S
Serge Abiteboul
Researcher at French Institute for Research in Computer Science and Automation
Publications - 279
Citations - 25002
Serge Abiteboul is an academic researcher from French Institute for Research in Computer Science and Automation. The author has contributed to research in topics: XML & Query language. The author has an hindex of 73, co-authored 278 publications receiving 24576 citations. Previous affiliations of Serge Abiteboul include University of Southern California & PSL Research University.
Papers
More filters
Proceedings ArticleDOI
Objects and views
TL;DR: This paper presents a mechanism, one which allows a programmer to restructure the class hierarchy and modify the behavior and structure of objects, and allows him to specify attribute values implicitly, rather than storing them.
Proceedings ArticleDOI
From structured documents to novel query facilities
TL;DR: A natural mapping from SGML documents into OODB's and a formal extension of two OodB query languages in order to deal with SGML document retrieval and a key element is the introduction of paths as first class citizens.
Journal ArticleDOI
PARIS: probabilistic alignment of relations, instances, and schema
TL;DR: This work presents paris, an approach for the automatic alignment of ontologies, which aligns not only instances, but also relations and classes and provides a truly holistic solution to the problem of ontology alignment.
Proceedings ArticleDOI
Corroborating information from disagreeing views
TL;DR: It is believed that corroboration can serve in a wide range of applications such as source selection in the semantic Web, data quality assessment or semantic annotation cleaning in social networks, and this work sets the bases for a widerange of techniques for solving these more complex problems.
Journal ArticleDOI
On the representation and querying of sets of possible worlds
TL;DR: This work provides matching upper and lower bounds on the data-complexity of testing containment, membership and uniqueness for sets of possible worlds and shows that the certain fact problem is coNP-complete, even for a fixed first order query applied to a Codd-table.