Database theory - ICDT 2003 : 9th International Conference Siena, Italy, January 8 10, 2003 : proceedings
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
2572 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Database theory, ICDT 2003, 9th international conference, Siena, Italy, January 8-10, 2003, proceedings, Diego Calvanese, Maurizio Lenzerini, Rajeev Motwani (eds.), Berlin, Springer, 2003, 1 vol. (XI-454 p.), Lecture notes in computer science, 3-540-00323-1 • Database Theory - ICDT 2003, Texte imprimé, 9783662200452 |
Obsah:
- 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.