Diego Calvanese / Maurizio Lenzerini / Rajeev Motwani (eds.)

Database Theory - ICDT 2003

9th International Conference, Siena, Italy, January 8-10, 2003, Proceedings
Herausgegeben:Calvanese, Diego; Lenzerini, Maurizio; Motwani, Rajeev

• Broschiertes Buch

Produktbeschreibung

This volume collects the papers presented at ICDT 2003, the 9th International ConferenceonDatabaseTheory,heldfrom8to10January2003intheRettorato dell Universit` a di Siena, Siena, Italy. 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 .

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 2572
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-00323-6
• 2003
• Seitenzahl: 472
• Erscheinungstermin: 13. Dezember 2002
• Englisch
• Abmessung: 235mm x 155mm x 26mm
• Gewicht: 658g
• ISBN-13: 9783540003236
• ISBN-10: 3540003231
• Artikelnr.: 23386495

Autorenporträt

Diego Calvanese, "La Sapienza" University of Rome, Italy / Maurizio Lenzerini, "La Sapienza" University of Rome, Italy / Rajeev Motwani, Stanford University, Stanford, CA, USA

Inhaltsangabe

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.