Serge Abiteboul
Encyclopedia
Serge Joseph Abiteboul is a computer scientist
working in the areas of data management
, database theory
, and finite model theory
.
He received his PhD from the University of Southern California
under the supervision of Seymour Ginsburg
, in 1982.
He is currently 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.
He is well known for his 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. 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. He is also known for two influential books, one on database theory and one on Web data management. He became a member of the French Academy of Sciences
in 2008.
Computer scientist
A computer scientist is a scientist who has acquired knowledge of computer science, the study of the theoretical foundations of information and computation and their application in computer systems....
working in the areas of data management
Data management
Data management comprises all the disciplines related to managing data as a valuable resource.- Overview :The official definition provided by DAMA International, the professional organization for those in the data management profession, is: "Data Resource Management is the development and execution...
, database theory
Database theory
Database theory encapsulates a broad range of topics related to the study and research of the theoretical realm of databases and database management systems....
, and finite model theory
Finite model theory
Finite Model Theory is a subarea of model theory . MT is the branch of mathematical logic which deals with the relation between a formal language and its interpretations . FMT is a restriction of MT to interpretations of finite structures, i.e...
.
He received his PhD from the University of Southern California
University of Southern California
The University of Southern California is a private, not-for-profit, nonsectarian, research university located in Los Angeles, California, United States. USC was founded in 1880, making it California's oldest private research university...
under the supervision of Seymour Ginsburg
Seymour Ginsburg
Seymour Ginsburg was a pioneer of automata theory, formal language theory, anddatabase theory, in particular; and computer science, in general...
, in 1982.
He is currently a senior researcher at the Institut national de recherche en informatique et en automatique
Institut national de recherche en informatique et en automatique
The National Institute for Research in Computer Science and Control is a French national research institution focusing on computer science, control theory and applied mathematics.It was created in 1967 at Rocquencourt near Paris, part of Plan Calcul...
(INRIA), the French national research institute focussing on computer science
Computer science
Computer science or computing science is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems...
and related areas.
He is well known for his contributions in the areas of finite model theory
Finite model theory
Finite Model Theory is a subarea of model theory . MT is the branch of mathematical logic which deals with the relation between a formal language and its interpretations . FMT is a restriction of MT to interpretations of finite structures, i.e...
, database theory, and database systems. In finite model theory, the Abiteboul-Vianu Theorem states that polynomial time is equal to PSPACE
PSPACE
In computational complexity theory, PSPACE is the set of all decision problems which can be solved by a Turing machine using a polynomial amount of space.- Formal definition :...
if and only if fixed point logic
Least fixed point
In order theory, a branch of mathematics, the least fixed point of a function is the fixed point which is less than or equal to all other fixed points, according to some partial order....
is the same as partial fixed point logic. 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
CiteSeer
CiteSeer was a public search engine and digital library for scientific and academic papers. It is often considered to be the first automated citation indexing system and was considered a predecessor of academic search tools such as Google Scholar and Microsoft Academic Search. It was replaced by...
, he is the most highly cited researcher in the data management area who works at a European institution. He is also known for two influential books, one on database theory and one on Web data management. He became a member of the French Academy of Sciences
French Academy of Sciences
The French Academy of Sciences is a learned society, founded in 1666 by Louis XIV at the suggestion of Jean-Baptiste Colbert, to encourage and protect the spirit of French scientific research...
in 2008.