Database Theory - ICDT 2003: 9th International Conference, Siena, Italy, January 8-10, 2003, Proceedings (Lecture Notes in Computer Science, 2572)

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. This Volume Collects The Papers Presented At Icdt 2003, The 9th International Conferenceondatabasetheory,heldfrom8to10january2003intherettorato Dell’universit` A Di Siena, Siena, Italy. Icdt (http://alpha.luc.ac.be/ ̃lucp1080/icdt/) Has Now A Long T- Dition Of International Conferences, Providing A Biennial Scienti?c Forum For The Communicationofhigh-qualityresearchresultsontheoreticalaspectsofallforms Of Database Systems And Database Technology. Icdt Is Traditionally Held In - Storic European Locations: Rome In 1986, Bruges In 1988, Paris In 1990, Berlin In 1992, Prague In 1995, Delphi In 1997, Jerusalem In 1999, And London In 2001. Icdthasmergedwiththesymposiumonmathematicalfundamentalsofda- Base Systems (mfdbs), Initiated In Dresden In 1987, And Continued In Visegrad In 1989 And Rostock In 1991. This Volume Contains 26 Papers Selected From 92 Submissions, Plus Three Invited Papers By Hector Garcia-molina, Yannis Ioannidis, And Limsoon Wong. We Wish To Thank All The Authors Who Submitted Papers, The Members Of The Program Committee For Their E?orts In Reviewing And Selecting The Papers, The External Referees, The Organizing Committee, And The Sponsors For Their Support. Diego Calvanese Maurizio Lenzerini Rajeev Motwani Organization Icdt 2003 Was Organized By The Dipartimento Di Informatica E Sistemistica, Universit` A Di Roma “la Sapienza”. Invited Papers -- Open Problems In Data-sharing Peer-to-peer Systems -- Approximations In Database Systems -- Bioinformatics Adventures In Database Research -- Reasoning About Xml Schemas And Queries -- Incremental Validation Of Xml Documents -- Typechecking Top-down Uniform Unranked Tree Transducers -- Structural Properties Of Xpath Fragments -- On Reasoning About Structural Equality In Xml: A Description Logic Approach -- Aggregate Queries -- Containment Of Aggregate Queries -- Auditing Sum Queries -- Crb-tree: An Efficient Indexing Scheme For Range-aggregate Queries -- Optimal Range Max Datacube For Fixed Dimensions -- Query Evaluation -- Processing Xml Streams With Deterministic Automata -- Deciding Termination Of Query Evaluation In Transitive-closure Logics For Constraint Databases -- Query Rewriting And Reformulation -- Data Exchange: Semantics And Query Answering -- Reformulation Of Xml Queries And Constraints -- New Rewritings And Optimizations For Regular Path Queries -- Database Interrogation Using Conjunctive Queries -- Semistructured Versus Structured Data -- On The Difficulty Of Finding Optimal Relational Decompositions For Xml Workloads: A Complexity Theoretic Perspective -- Generating Relations From Xml Documents -- Query Containment -- Containment For Xpath Fragments Under Dtd Constraints -- Xpath Containment In The Presence Of Disjunction, Dtds, And Variables -- Decidable Containment Of Recursive Queries -- Containment Of Conjunctive Queries With Safe Negation -- Consistency And Incompleteness -- Probabilistic Interval Xml -- Condensed Representation Of Database Repairs For Consistent Query Answering -- Typing Graph-manipulation Operations -- Characterizing The Temporal And Semantic Coherency Of Broadcast-based Data Dissemination -- Data Structures -- An Efficient Indexing Scheme For Multi-dimensional Moving Objects -- Nearest Neighbors Can Be Found Efficiently If The Dimension Is Small Relative To The Input Size. Edited By Diego Calvanese, Maurizio Lenzerini, Rajeev Motwani. 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 Peer-to-peer (P2P) systems have recently become a very active research area, due to the popularity and widespread use of P2P systems today, and their potential uses in future applications.