9. ICDT 2003: Siena, Italy

Invited Papers

• Neil Daswani, Hector Garcia-Molina, Beverly Yang:
  Open Problems in Data-Sharing Peer-to-Peer Systems. 1-15
  
• Yannis E. Ioannidis:
  Approximations in Database Systems. 16-30
  
• Jinyan Li, See-Kiong Ng, Limsoon Wong:
  Bioinformatics Adventures in Database Research. 31-46
  

Reasoning about XML Schemas and Queries

• Yannis Papakonstantinou, Victor Vianu:
  Incremental Validation of XML Documents. 47-63
  
• Wim Martens, Frank Neven:
  Typechecking Top-Down Uniform Unranked Tree Transducers. 64-78
  
• Michael Benedikt, Wenfei Fan, Gabriel M. Kuper:
  Structural Properties of XPath Fragments. 79-95
  
• David Toman, Grant E. Weddell:
  On Reasoning about Structural Equality in XML: A Description Logic Approach. 96-110
  

Aggregate Queries

• Sara Cohen, Werner Nutt, Yehoshua Sagiv:
  Containment of Aggregate Queries. 111-125
  
• Francesco M. Malvestuto, Mauro Mezzini:
  Auditing Sum Queries. 126-142
  
• Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge:
  CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. 143-157
  
• Chung Keung Poon:
  Optimal Range Max Datacube for Fixed Dimensions. 158-172
  

Query Evaluation

• Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan Suciu:
  Processing XML Streams with Deterministic Automata. 173-189
  
• Floris Geerts, Bart Kuijpers:
  Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases. 190-206
  

Query Rewriting and Reformulation

• Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa:
  Data Exchange: Semantics and Query Answering. 207-224
  
• Alin Deutsch, Val Tannen:
  Reformulation of XML Queries and Constraints. 225-241
  
• Gösta Grahne, Alex Thomo:
  New Rewritings and Optimizations for Regular Path Queries. 242-258
  
• Michal Bielecki, Jan Van den Bussche:
  Database Interrogation Using Conjunctive Queries. 259-269
  

Semistructured versus Structured Data

• Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Jeffrey F. Naughton:
  On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective. 267-281
  
• Sara Cohen, Yaron Kanza, Yehoshua Sagiv:
  Generating Relations from XML Documents. 282-296
  

Query Containment

• Peter T. Wood:
  Containment for XPath Fragments under DTD Constraints. 297-311
  
• Frank Neven, Thomas Schwentick:
  XPath Containment in the Presence of Disjunction, DTDs, and Variables. 312-326
  
• Diego Calvanese, Giuseppe De Giacomo, Moshe Y. Vardi:
  Decidable Containment of Recursive Queries. 327-342
  
• Fang Wei, Georg Lausen:
  Containment of Conjunctive Queries with Safe Negation. 343-357
  

Consistency and Incompleteness

• Edward Hung, Lise Getoor, V. S. Subrahmanian:
  Probabilistic Interval XML. 358-374
  
• Jef Wijsen:
  Condensed Representation of Database Repairs for Consistent Query Answering. 375-390
  
• Jan Hidders:
  Typing Graph-Manipulation Operations. 391-406
  
• Evaggelia Pitoura, Panos K. Chrysanthis, Krithi Ramamritham:
  Characterizing the Temporal and Semantic Coherency of Broadcast-Based Data Dissemination. 407-421
  

Data Structures

• Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel:
  An Efficient Indexing Scheme for Multi-dimensional Moving Objects. 422-436
  
• Michiel Hagedoorn:
  Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size. 437-451