Serge Abiteboul

Serge Abiteboul
Serge Abiteboul in 2016
Born Serge Joseph Abiteboul
(1953-08-25) 25 August 1953
Nationality French
Citizenship French
Alma mater University of Southern California (PhD)
Known for
  • Abiteboul-Vianu Theorem
  • Data on the Web[1]
Awards
Scientific career
Fields Data bases[3]
Institutions INRIA
Thesis Matching Functions and Disaggregations in Databases (1982)
Doctoral advisor Seymour Ginsburg[4]
Website abiteboul.com

Serge Joseph Abiteboul (born 1953) is a French computer scientist working in the areas of data management, database theory, and finite model theory.[3][2][5][6][7][1][8]

Education

Abiteboul received his PhD from the University of Southern California under the supervision of Seymour Ginsburg, in 1982.[9][4]

Career and research

Abiteboul is a senior researcher at the Institut national de recherche en informatique et en automatique (INRIA), the French national research institute focussing on computer science and related areas, and has been a professor of the Collège de France.[10]

He is known for his many contributions in the areas of finite model theory, database theory, and database systems. In finite model theory, the Abiteboul-Vianu Theorem states that polynomial time is equal to PSPACE if and only if fixed point logic is the same as partial fixed point logic.[11][12] In database theory, he has contributed a wide variety of results, the most recent on languages for the distributed processing of XML data. In data management, he is best known for his early work on semistructured and Web databases. In 2008, according to Citeseer, he is the most highly cited researcher in the data management area who works at a European institution.

Abiteboul is also known for two books, one on database theory[13] and one on Web data management.[1]

Awards and honours

Abiteboul was awarded the Association for Computing Machinery (ACM) SIGMOD Test of Time Award in 2004, the Prix EADS in 2007, and the ACM PODS Alberto O. Mendelzon Test-of-Time Award (2008). Abiteboul was elected a member of the French Academy of Sciences in 2008, of the European Academy of Sciences in 2011, and an ACM Fellow in 2011.[2]

References

  1. 1 2 3 Abiteboul, Serge; Buneman, Peter; Suciu, Dan (2000). Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann. ISBN 155860622X.
  2. 1 2 3 Serge Abiteboul author profile page at the ACM Digital Library
  3. 1 2 Serge Abiteboul publications indexed by Google Scholar Edit this at Wikidata
  4. 1 2 Serge Abiteboul at the Mathematics Genealogy Project
  5. ↑ Winslett, M. (2008). "Serge Abiteboul speaks out" (PDF). ACM SIGMOD Record. 37: 25. doi:10.1145/1374780.1374787.
  6. ↑ Web Data Management, Serge Abiteboul, Ioana Manolescu, Philippe Rigaux, Marie-Christine Rousset, Pierre Senellart, Cambridge University Press, 2011. http://webdam.inria.fr/Jorge/ ISBN 1107012430
  7. ↑ Serge Abiteboul at DBLP Bibliography Server Edit this at Wikidata
  8. ↑ Djeraba, C.; Bouet, M.; Briand, H.; Khenchaf, A. (2000). "Visual and textual content based indexing and retrieval". International Journal on Digital Libraries. 2 (4): 269. doi:10.1007/s007990050005.
  9. ↑ Abiteboul, Serge Joseph (1982). Matching Functions and Disaggregations in Databases. proquest.com (PhD thesis). University of Southern California. OCLC 8982457.
  10. ↑ "Liste des professeurs depuis la fondation du Collège de France en 1530" (PDF). college-de-france.fr. Collège de France. Archived from the original (PDF) on 2016-03-03.
  11. ↑ Abiteboul, S.; Vianu, V. (1991). "Generic Computation and its complexity". Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91. p. 209. doi:10.1145/103418.103444. ISBN 0897913973.
  12. ↑ Abiteboul, S.; Vianu, V. (1995). "Computing with First-Order Logic". Journal of Computer and System Sciences. 50 (2): 309. doi:10.1006/jcss.1995.1025.
  13. ↑ Serge Abiteboul, Richard B. Hull, Victor Vianu: Foundations of Databases. Addison-Wesley, 1995. http://webdam.inria.fr/Alice/ ISBN 0201537710
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.