Proceedings of the 9th International Conference on Database Theory (ICDT), Siena, Italy, 2003

Original publisher: Springer Verlag, LNCS - Lecture Notes in Computer Science, Volume: 2572, ISBN: 3-540-00323-1, Electronic Edition

Invited Papers

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

Research Sessions

Reasoning about XML Schemas and Queries
[DOI] Incremental Validation of XML Documents.
Yannis Papakonstantinou, Victor Vianu   pp. 47-63
[DOI] Typechecking Top-Down Uniform Unranked Tree Transducers.
Wim Martens, Frank Neven   pp. 64-78
[DOI] Structural Properties of XPath Fragments.
Michael Benedikt, Wenfei Fan, Gabriel M. Kuper   pp. 79-95
[DOI] On Reasoning about Structural Equality in XML: A Description Logic Approach.
David Toman, Grant E. Weddell   pp. 96-110
Aggregate Queries
[DOI] Containment of Aggregate Queries.
Sara Cohen, Werner Nutt, Yehoshua Sagiv   pp. 111-125
[DOI] Auditing Sum Queries.
Francesco M. Malvestuto, Mauro Mezzini   pp. 126-142
[DOI] CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries.
Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge   pp. 143-157
[DOI] Optimal Range Max Datacube for Fixed Dimensions.
Chung Keung Poon   pp. 158-172
Query Evaluation
[DOI] Processing XML Streams with Deterministic Automata.
Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan Suciu   pp. 173-189
[DOI] Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases.
Floris Geerts, Bart Kuijpers   pp. 190-206
Query Rewriting and Reformulation
[DOI] Data Exchange: Semantics and Query Answering.
Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa   pp. 207-224
[DOI] Reformulation of XML Queries and Constraints.
Alin Deutsch, Val Tannen   pp. 225-241
[DOI] New Rewritings and Optimizations for Regular Path Queries.
Gösta Grahne, Alex Thomo   pp. 242-258
[DOI] Database Interrogation Using Conjunctive Queries.
Michal Bielecki, Jan Van den Bussche   pp. 259-269
Semistructured versus Structured Data
[DOI] On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective.
Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Jeffrey F. Naughton   pp. 267-281
[DOI] Generating Relations from XML Documents.
Sara Cohen, Yaron Kanza, Yehoshua Sagiv   pp. 282-296
Query Containment
[DOI] Containment for XPath Fragments under DTD Constraints.
Peter T. Wood   pp. 297-311
[DOI] XPath Containment in the Presence of Disjunction, DTDs, and Variables.
Frank Neven, Thomas Schwentick   pp. 312-326
[DOI] Decidable Containment of Recursive Queries.
Diego Calvanese, Giuseppe De Giacomo, Moshe Y. Vardi   pp. 327-342
[DOI] Containment of Conjunctive Queries with Safe Negation.
Fang Wei, Georg Lausen   pp. 343-357
Consistency and Incompleteness
[DOI] Probabilistic Interval XML.
Edward Hung, Lise Getoor, V. S. Subrahmanian   pp. 358-374
[DOI] Condensed Representation of Database Repairs for Consistent Query Answering.
Jef Wijsen   pp. 375-390
[DOI] Typing Graph-Manipulation Operations.
Jan Hidders   pp. 391-406
[DOI] Characterizing the Temporal and Semantic Coherency of Broadcast-Based Data Dissemination.
Evaggelia Pitoura, Panos K. Chrysanthis, Krithi Ramamritham   pp. 407-421
Data Structures
[DOI] An Efficient Indexing Scheme for Multi-dimensional Moving Objects.
Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel   pp. 422-436
[DOI] Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size.
Michiel Hagedoorn   pp. 437-451
The full-text material linked from here is (c) Springer Verlag. The 'get via DOI' ([DOI]) link loads the full-text from Springer Link. Notice that a subscription (or pay-per-view) is necessary to actually load the PDFs.
Menu
Related links