Serge Abiteboul

Last updated
Serge Abiteboul
Serge Abiteboul - mai 2016.jpg
Serge Abiteboul in 2016
Born
Serge Joseph Abiteboul

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

Serge Joseph Abiteboul (born 25 August 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] [ excessive citations ]

Contents

Education

The son of two hardware store owners, Abiteboul attended high-school in Romorantin, and Higher School Preparatory Classes in Tours. [13] He was admitted to the Télécom Paris engineering school and studied 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).[ citation needed ] 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]

Related Research Articles

<span class="mw-page-title-main">Alain Colmerauer</span> French computer scientist

Alain Colmerauer was a French computer scientist. He was a professor at Aix-Marseille University, and the creator of the logic programming language Prolog.

Database theory encapsulates a broad range of topics related to the study and research of the theoretical realm of databases and database management systems.

Finite model theory is a subarea of model theory. Model theory is the branch of logic which deals with the relation between a formal language (syntax) and its interpretations (semantics). Finite model theory is a restriction of model theory to interpretations on finite structures, which have a finite universe.

In computer science, the expressive power of a language is the breadth of ideas that can be represented and communicated in that language. The more expressive a language is, the greater the variety and quantity of ideas it can be used to represent.

.QL is an object-oriented query language used to retrieve data from relational database management systems. It is reminiscent of the standard query language SQL and the object-oriented programming language Java. .QL is an object-oriented variant of a logical query language called Datalog. Hierarchical data can therefore be naturally queried in .QL in a recursive manner.

<span class="mw-page-title-main">Ronald Fagin</span> American mathematician and computer scientist

Ronald Fagin is an American mathematician and computer scientist, and IBM Fellow at the IBM Almaden Research Center. He is known for his work in database theory, finite model theory, and reasoning about knowledge.

Codd's theorem states that relational algebra and the domain-independent relational calculus queries, two well-known foundational query languages for the relational model, are precisely equivalent in expressive power. That is, a database query can be formulated in one language if and only if it can be expressed in the other.

Oscar Peter Buneman, is a British computer scientist who works in the areas of database systems and database theory.

Dan Suciu is a full professor of computer science at the University of Washington. He received his Ph.D. from the University of Pennsylvania in 1995 under the supervision of Val Tannen. After graduation, he was a principal member of the technical staff at AT&T Labs until he joined the University of Washington in 2000. Suciu does research in data management, with an emphasis on Web data management and managing uncertain data. He is a co-author of an influential book on managing semistructured data.

David Maier is the Maseeh Professor of Emerging Technologies in the Department of Computer Science at Portland State University. Born in Eugene, OR, he has also been a computer science faculty member at the State University of New York at Stony Brook (1978–82), Oregon Graduate Center, University of Wisconsin, Oregon Health & Science University (2001–present) and National University of Singapore (2012–15). He holds a B.A. in Mathematics and Computer Science from the University of Oregon and a Ph.D. in Electrical Engineering and Computer Science from Princeton University (1978).

Victor Vianu is a computer scientist, a professor of computer science and engineering at the University of California, San Diego. He served as editor-in-chief of the Journal of the ACM from 2009 to 2015.

<span class="mw-page-title-main">Tova Milo</span> Israeli computer scientist

Tova Milo is a full Professor of Computer Science at Tel Aviv University and the Dean of the Faculty of Exact Sciences. She served as the head of the Computer Science Department from 2011 to 2014. Milo is the head of the data management group in Tel Aviv University, and her research focuses on Web data management. She received her PhD from the Hebrew University in 1992 under the supervision of Catriel Beeri, and was a postdoctoral fellow at the University of Toronto and INRIA, France, prior to joining Tel Aviv University.

In relational database theory, a tuple-generating dependency (TGD) is a certain kind of constraint on a relational database. It is a subclass of the class of embedded dependencies (EDs).

Leonid Libkin is a computer scientist who works in data management, in particular in database theory, and in logic in computer science.

Laure Murat, born 4 June 1967, in Paris, is a French historian, writer, and professor at the University of California, Los Angeles.

<span class="mw-page-title-main">Marc Fontecave</span> French chemist (born 1956)

Marc Fontecave is a French chemist. An international specialist in bioinorganic chemistry, he currently teaches at the Collège de France in Paris, where he heads the Laboratory of Chemistry of Biological Processes.

<span class="mw-page-title-main">Véronique Cortier</span> French mathematician and computer scientist

Véronique Cortier is a French mathematician and computer scientist specializing in cryptography. Her research has applied mathematical logic in the formal verification of cryptographic protocols, and has included the development of secure electronic voting systems. She has also contributed to the public dissemination of knowledge about cryptography through a sequence of posts on the binaire blog of Le Monde. She is a director of research with CNRS, associated with the Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) at the University of Lorraine in Nancy.

Olivier Gascuel is a French researcher in bioinformatics. He is a research director at the CNRS. His work focuses in particular on phylogeny. He was the director of the Centre for Bioinformatics, Biostatistics and Integrative Biology at the Pasteur Institute from 2015 till 2020. In 2021, he joined the Institute of Systematics, Evolution, Biodiversity (ISYEB) at the National Museum of Natural History, France.

In database theory, the query evaluation problem is the problem of determining the answers to a query on a database. Research in database theory aims at determining the computational complexity of answering different kinds of queries over databases, in particular over relational databases.

Relational transducers are a theoretical model for studying computer systems through the lens of database relations. This model extends the transducer model in formal language theory. They were first introduced in 1998 by Abiteboul et al for the study of electronic commerce applications. The computation model treats the input and output as sequences of relations. The state of the transducer is a state of a database and transitions through the state machine can be thought of as updates to the database state. The model was inspired by the design of active databases and motivated by a desire to be able to express business applications declaratively via logical formulas.

References

  1. ↑ "Les Membres de l'Académie des sciences élus en 2008 et 2009" (PDF). academie-sciences.fr. Académie des sciences. June 16, 2009.
  2. ↑ Immerman, Neil (2012). "12.6 Abiteboul-Vianu and Otto Theorems". 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 (Cat. No.98CB36226). pp. 28–43. doi:10.1109/LICS.1998.705641. ISBN   978-0-8186-8506-4. S2CID   206438299.
  4. 1 2 3 Abiteboul, Serge; Buneman, Peter; Suciu, Dan (2000). Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann. ISBN   978-1558606227.
  5. 1 2 3 Serge Abiteboul author profile page at the ACM Digital Library
  6. 1 2 Serge Abiteboul publications indexed by Google Scholar OOjs UI icon edit-ltr-progressive.svg
  7. 1 2 Serge Abiteboul at the Mathematics Genealogy Project
  8. 1 2 "11 nouveaux Membres élus à l'Académie des sciences" (PDF). academie-sciences.fr. Académie des sciences. December 17, 2008.
  9. ↑ Winslett, M. (2008). "Serge Abiteboul speaks out" (PDF). ACM SIGMOD Record. 37: 25–33. doi:10.1145/1374780.1374787. S2CID   41089594.
  10. ↑ 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
  11. ↑ Serge Abiteboul at DBLP Bibliography Server OOjs UI icon edit-ltr-progressive.svg
  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. S2CID   12991042.
  13. ↑ "Serge Abiteboul par-delà les données". lanouvellerepublique.fr. La nouvelle République. May 20, 2017.
  14. ↑ "Serge Abiteboul : Sciences des données, de la logique du premier ordre à la Toile". franceculture.fr. 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). college-de-france.fr. 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. S2CID   12707902.
  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. http://webdam.inria.fr/Alice/ ISBN   0201537710
  20. ↑ "Science-fiction sauce numérique". lemonde.fr. Le Monde. January 18, 2019.
  21. 1 2 "Pourquoi Internet doit rester neutre". liberation.fr. Libération. July 5, 2018.
  22. ↑ "Des robots à l'hôpital". latribune.fr. La Tribune. January 28, 2019.
  23. ↑ "Internet : neutre mais pas trop ?". franceculture.fr. France Culture. September 5, 2019.
  24. ↑ "Il vaudrait mieux attendre l'arrivée d'assistants vocaux soucieux de protéger nos données". lemonde.fr. Le Monde. June 26, 2018.
  25. ↑ "Comment la France compte lutter contre la haine et le harcèlement en ligne". lemonde.fr. Le Monde. February 14, 2019.
  26. ↑ "SIGMOD Test of Time Award". Sigmod.org. Sigmod ACM.
  27. ↑ "Lauréats 2007 des Prix de l'Académie des sciences" (PDF). academie-sciences.fr. Académie des sciences. 2007.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.