Serge Abiteboul

Serge Joseph Abiteboul (born August 25, 1953 in Paris, France)[8] is a French computer scientist working in the areas of data management, database theory, and finite model theory.[6][5][9][10][11][4][12]

Serge Abiteboul
Serge Abiteboul in 2016
Serge Joseph Abiteboul

(1953-08-25) 25 August 1953[1]
Alma materUniversity of Southern California (PhD)
Known for
  • Abiteboul-Vianu Theorem[2][3]
  • Data on the Web[4]
Scientific career
FieldsData bases[6]
ThesisMatching Functions and Disaggregations in Databases (1982)
Doctoral advisorSeymour Ginsburg[7]


The son of two hardware store owners, Abiteboul attends high-school in Romorantin, and Higher School Preparatory Classes in Tours[13]. He is admitted to the Telecom Paris engineering school and studies at the Technion in Haifa for a year[14].

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

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.[16]

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.[17][18] 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[19] and one on Web data management.[4]. He frequently writes for French newspapers, including Le Monde[20], Libération[21] and La Tribune[22]

A member of the ARCEP, the independent agency in charge of regulating telecommunications in France[23], Abiteboul has been an advocate of net neutrality[21]. He has also been critical of virtual assistants and their impact on privacy[24].

In 2019, he is among the members of a group tasked by the French government with addressing online bullying and harassment[25].

Awards and honours

Abiteboul was awarded the Association for Computing Machinery (ACM) SIGMOD Test of Time Award in 2004[26], the Prix EADS in 2007[27] 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[8], of the European Academy of Sciences in 2011, and an ACM Fellow in 2011.[5]


  1. "Les Membres de l'Académie des sciences élus en 2008 et 2009" (PDF). Académie des sciences. June 16, 2009.
  2. Immerman, Neil (2012). Descriptive Complexity. New York: Springer. p. 193. ISBN 9781461205395.
  3. Dawar A, Hella L, Seth A (24 June 1998). "Ordering finite variable types with generalized quantifiers". Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science: 28–43. doi:10.1109/LICS.1998.705641. ISBN 978-0-8186-8506-4. Retrieved 14 February 2019.
  4. Abiteboul, Serge; Buneman, Peter; Suciu, Dan (2000). Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann. ISBN 978-1558606227.
  5. Serge Abiteboul author profile page at the ACM Digital Library
  6. Serge Abiteboul publications indexed by Google Scholar
  7. Serge Abiteboul at the Mathematics Genealogy Project
  8. "11 nouveaux Membres élus à l'Académie des sciences" (PDF). Académie des sciences. December 17, 2008.
  9. Winslett, M. (2008). "Serge Abiteboul speaks out" (PDF). ACM SIGMOD Record. 37: 25. doi:10.1145/1374780.1374787.
  10. Web Data Management, Serge Abiteboul, Ioana Manolescu, Philippe Rigaux, Marie-Christine Rousset, Pierre Senellart, Cambridge University Press, 2011. ISBN 1107012430
  11. Serge Abiteboul at DBLP Bibliography Server
  12. 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.
  13. "Serge Abiteboul par-delà les données". La nouvelle République. May 20, 2017.
  14. "Serge Abiteboul : Sciences des données, de la logique du premier ordre à la Toile". France Culture. August 4, 2016.
  15. Abiteboul, Serge Joseph (1982). Matching Functions and Disaggregations in Databases (PhD thesis). University of Southern California. OCLC 8982457. ProQuest 303233018.
  16. "Liste des professeurs depuis la fondation du Collège de France en 1530" (PDF). Collège de France. Archived from the original (PDF) on 2016-03-03.
  17. 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 978-0897913973.
  18. 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.
  19. Serge Abiteboul, Richard B. Hull, Victor Vianu: Foundations of Databases. Addison-Wesley, 1995. ISBN 0201537710
  20. "Science-fiction sauce numérique". Le Monde. January 18, 2019.
  21. "Pourquoi Internet doit rester neutre". Libération. July 5, 2018.
  22. "Des robots à l'hôpital". La Tribune. January 28, 2019.
  23. "Internet : neutre mais pas trop ?". France Culture. September 5, 2019.
  24. "Il vaudrait mieux attendre l'arrivée d'assistants vocaux soucieux de protéger nos données". Le Monde. June 26, 2018.
  25. "Comment la France compte lutter contre la haine et le harcèlement en ligne". Le Monde. February 14, 2019.
  26. "SIGMOD Test of Time Award". Sigmod ACM.
  27. "Lauréats 2007 des Prix de l'Académie des sciences" (PDF). Académie des sciences. 2007.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.