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
Posted Content
The Lowell Database Research Self Assessment
Serge Abiteboul,Rakesh Agrawal,Phil Bernstein,Michael J. Carey,Stefano Ceri,Bruce Croft,David J. DeWitt,Michael J. Franklin,Hector Garcia Molina,Dieter Gawlick,Jim Gray,Laura M. Haas,Alon Halevy,Joseph M. Hellerstein,Yannis Ioannidis,Martin L. Kersten,Michael J. Pazzani,Michael Lesk,David Maier,Jeffrey F. Naughton,Hans Schek,Timos Sellis,Avi Silberschatz,Michael Stonebraker,Richard T. Snodgrass,Jeffrey D. Ullman,Gerhard Weikum,Jennifer Widom,Stan Zdonik +28 more
TL;DR: This article proposes research into several important new directions for database management systems, driven by the Internet and increasing amounts of scientific and sensor data.
Proceedings ArticleDOI
Generic Computation and its complexity
Serge Abiteboul,Victor Vianu +1 more
TL;DR: A normal form is proved for the Turing Machines, which provides a key technical tool for while queries, and complexity measures for generic mappings are defined, focusing on notions of polynomial time and space complexit y forGeneric mappings, and show their robustness.
Journal ArticleDOI
Non first normal form relations: An algebra allowing data restructuring
Serge Abiteboul,Nicole Bidoit +1 more
TL;DR: A key feature of the model is an algebraic query language allowing data restructuring, and a natural connection between instances in this model, and relational database instances satisfying the Universal Relation Scheme Assumption is investigated.
Proceedings ArticleDOI
Query flocks: a generalization of association-rule mining
Dick Tsur,Jeffrey D. Ullman,Serge Abiteboul,Chris Clifton,Rajeev Motwani,Svetlozar Nestorov,Arnon Rosenthal +6 more
TL;DR: The general idea, called “query flocks,” is a generate-and-test model for data-mining problems and is shown how the idea can be used either in a general-purpose mining system or in a next generation of conventional query optimizers.
Proceedings ArticleDOI
Compact labeling schemes for ancestor queries
TL;DR: This paper proposes a labeling scheme with maximum label size close to 3/2 log n, which is close to the lower bound of log n that follows from the fact that different vertices must have different labels.