Database Theory — ICDT 2003: 9th International Conference Siena, Italy, January 8–10, 2003 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 9th International Conference on Database Theory, ICDT 2002, held in Siena, Italy in January 2002.

The 26 revised full papers presented together with 3 invited articles were carefully reviewed and selected from 92 submissions. The papers are organized in topical sections on reasoning about XML schemas and queries, aggregate queries, query evaluation, query rewriting and reformulation, semistructured versus structured data, query containment, consistency and incompleteness, and data structures.

Author(s): Neil Daswani, Hector Garcia-Molina, Beverly Yang (auth.), Diego Calvanese, Maurizio Lenzerini, Rajeev Motwani (eds.)
Series: Lecture Notes in Computer Science 2572
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2002

Language: English
Pages: 460
Tags: Database Management; Computation by Abstract Devices; Mathematical Logic and Formal Languages; Information Storage and Retrieval; Information Systems Applications (incl.Internet); Business Information Systems

Open Problems in Data-Sharing Peer-to-Peer Systems....Pages 1-15
Approximations in Database Systems....Pages 16-30
Bioinformatics Adventures in Database Research....Pages 31-46
Incremental Validation of XML Documents....Pages 47-63
Typechecking Top-Down Uniform Unranked Tree Transducers....Pages 64-78
Structural Properties of XPath Fragments....Pages 79-95
On Reasoning about Structural Equality in XML: A Description Logic Approach....Pages 96-110
Containment of Aggregate Queries....Pages 111-125
Auditing Sum Queries....Pages 126-142
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries....Pages 143-157
Optimal Range Max Datacube for Fixed Dimensions....Pages 158-172
Processing XML Streams with Deterministic Automata....Pages 173-189
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases....Pages 190-206
Data Exchange: Semantics and Query Answering....Pages 207-224
Reformulation of XML Queries and Constraints....Pages 225-241
New Rewritings and Optimizations for Regular Path Queries....Pages 242-258
Database Interrogation Using Conjunctive Queries....Pages 259-269
On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective....Pages 270-284
Generating Relations from XML Documents....Pages 285-299
Containment for XPath Fragments under DTD Constraints....Pages 300-314
XPath Containment in the Presence of Disjunction, DTDs, and Variables....Pages 315-329
Decidable Containment of Recursive Queries....Pages 330-345
Containment of Conjunctive Queries with Safe Negation....Pages 346-360
Probabilistic Interval XML....Pages 361-377
Condensed Representation of Database Repairs for Consistent Query Answering....Pages 378-393
Typing Graph-Manipulation Operations....Pages 394-409
Characterizing the Temporal and Semantic Coherency of Broadcast-Based Data Dissemination....Pages 410-424
An Efficient Indexing Scheme for Multi-dimensional Moving Objects....Pages 425-439
Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size....Pages 440-454