default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th ICDT 2007: Barcelona, Spain
- Thomas Schwentick, Dan Suciu:
Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings. Lecture Notes in Computer Science 4353, Springer 2007, ISBN 3-540-69269-X
Invited Lectures
- Jan Chomicki:
Consistent Query Answering: Five Easy Pieces. 1-17 - Cynthia Dwork:
Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis. 18-27 - Laura M. Haas:
Beauty and the Beast: The Theory and Practice of Information Integration. 28-43
Information Integration and Peer to Peer
- Michel de Rougemont, Adrien Vieilleribière:
Approximate Data Exchange. 44-58 - Alan Nash, Luc Segoufin, Victor Vianu:
Determinacy and Rewriting of Conjunctive Queries Using Views: A Progress Report. 59-73 - Tova Milo, Assaf Sagi, Elad Verbin:
Compact Samples for Data Dissemination. 74-88 - Alan Nash, Alin Deutsch:
Privacy in GLAV Information Integration. 89-103
Axiomatizations for XML
- Sven Hartmann, Sebastian Link
:
Unlocking Keys for XML Trees. 104-118 - Lucja Kot, Walker M. White:
Characterization of the Interaction of XML Functional Dependencies with DTDs. 119-133 - Balder ten Cate, Maarten Marx:
Axiomatizing the Logical Core of XPath 2.0. 134-148
Expressive Power of Query Languages
- Nilesh N. Dalvi:
Query Evaluation on a Database Given by a Random Graph. 149-163 - Riccardo Rosati:
The Limits of Querying Ontologies. 164-178
Incompleteness, Inconsistency, and Uncertainty
- Andrei Lopatenko, Leopoldo E. Bertossi:
Complexity of Consistent Query Answering in Databases Under Cardinality-Based and Incremental Repair Semantics. 179-193 - Lyublena Antova, Christoph Koch, Dan Olteanu:
World-Set Decompositions: Expressiveness and Efficient Algorithms. 194-208 - Peter Buneman, James Cheney, Stijn Vansummeren:
On the Expressiveness of Implicit Provenance in Query and Update Languages. 209-223 - Bart Kuijpers, Walied Othman:
Trajectory Databases: Data Models, Uncertainty and Complete Query Languages. 224-238
XML Schemas and Typechecking
- Piotr Wieczorek:
Complexity of Typechecking XML Views of Relational Databases. 239-253 - Sebastian Maneth, Thomas Perst, Helmut Seidl:
Exact XML Type Checking in Polynomial Time. 254-268 - Wouter Gelade, Wim Martens, Frank Neven:
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. 269-283
Stream Processing and Sequential Query Processing
- Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. 284-298 - Luc Segoufin, Cristina Sirangelo:
Constant-Memory Validation of Streaming XML Documents Against DTDs. 299-313
Ranking
- Gösta Grahne, Alex Thomo, William W. Wadge:
Preferentially Annotated Regular Path Queries. 314-328 - Benny Kimelfeld, Yehoshua Sagiv:
Combining Incompleteness and Ranking in Tree Queries. 329-343
XML Update and Query
- Edward L. Robertson, Lawrence V. Saxton, Dirk Van Gucht, Stijn Vansummeren:
Structural Recursion on Ordered Trees and List-Based Complex Objects. 344-358 - Marcelo Arenas, Pablo Barceló, Leonid Libkin:
Combining Temporal Logics for Querying XML Documents. 359-373 - Giorgio Ghelli, Kristoffer Høgsbro Rose, Jérôme Siméon:
Commutativity Analysis in XML Update Languages. 374-388
Query Containment
- Carles Farré, Werner Nutt, Ernest Teniente, Toni Urpí:
Containment of Conjunctive Queries over Databases with Null Values. 389-403 - Michel Leclère, Marie-Laure Mugnier:
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation. 404-418
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-05 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
