Database Theory – ICDT 2007 [electronic resource] : 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings /

Invited Lectures -- Consistent Query Answering: Five Easy Pieces -- Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis -- Beauty and the Beast: The Theory and Practice of Information Integration -- Information Integration and Peer to Peer -- Approximate Data Exchange -- Determinacy and Rewriting of Conjunctive Queries Using Views: A Progress Report -- Compact Samples for Data Dissemination -- Privacy in GLAV Information Integration -- Axiomatizations for XML -- Unlocking Keys for XML Trees -- Characterization of the Interaction of XML Functional Dependencies with DTDs -- Axiomatizing the Logical Core of XPath 2.0 -- Expressive Power of Query Languages -- Query Evaluation on a Database Given by a Random Graph -- The Limits of Querying Ontologies -- Incompleteness, Inconsistency, and Uncertainty -- Complexity of Consistent Query Answering in Databases Under Cardinality-Based and Incremental Repair Semantics -- World-Set Decompositions: Expressiveness and Efficient Algorithms -- On the Expressiveness of Implicit Provenance in Query and Update Languages -- Trajectory Databases: Data Models, Uncertainty and Complete Query Languages -- XML Schemas and Typechecking -- Complexity of Typechecking XML Views of Relational Databases -- Exact XML Type Checking in Polynomial Time -- Optimizing Schema Languages for XML: Numerical Constraints and Interleaving -- Stream Processing and Sequential Query Processing -- Database Query Processing Using Finite Cursor Machines -- Constant-Memory Validation of Streaming XML Documents Against DTDs -- Ranking -- Preferentially Annotated Regular Path Queries -- Combining Incompleteness and Ranking in Tree Queries -- XML Update and Query -- Structural Recursion on Ordered Trees and List-Based Complex Objects -- Combining Temporal Logics for QueryingXML Documents -- Commutativity Analysis in XML Update Languages -- Query Containment -- Containment of Conjunctive Queries over Databases with Null Values -- Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation.