Database theory - ICDT 2001 : 8th international conference, London, UK, January 4-6, 2001 : proceedings
This book constitutes the refereed proceedings of the 8th International Conference on Database Theory, ICDT 2001, held in London, UK, in January 2001. The 26 revised full papers presented together with two invited papers were carefully reviewed and selected from 75 submissions. All current issues on...
Gardado en:
| Autor Corporativo: | |
|---|---|
| Outros autores: | , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science
1973 |
| Sujets: | |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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 2001, 8th international conference, London, UK, January 4-6, 2001, proceedings, Jan van den Bussche, Victor Vianu (eds.), 2001, New York, Springer, 1 vol. (X-449 p.), Lecture notes in computer science, 3-540-41456-8 • Database Theory - ICDT 2001, Texte imprimé, 9783662209691 |
Table des matières:
- Expressive Power of SQL
- Query Evaluation via Tree-Decompositions
- Scalar Aggregation in FD-Inconsistent Databases
- On Decidability and Complexity of Description Logics with Uniqueness Constraints
- Expressiveness Issues and Decision Problems for Active Database Event Queries
- A Theory of Transactions on Recoverable Search Trees
- Minimizing View Sets without Losing Query-Answering Power
- Cost Based Data Dissemination in Broadcast Networks
- Parallelizing the Data Cube
- Asymptotically Optimal Declustering Schemes for Range Queries
- Flexible Data Cubes for Online Aggregation
- Mining for Empty Rectangles in Large Data Sets
- FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies
- Axiomatization of Frequent Sets
- On Answering Queries in the Presence of Limited Access Patterns
- The Dynamic Complexity of Transitive Closure Is in DynTC˚-- Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls
- A Semi-monad for Semi-structured Data (ICDT Version)
- Algebraic Rewritings for Optimizing Regular Path Queries
- Why and Where: A Characterization of Data Provenance
- Subsumption for XML Types
- Towards Aggregated Answers for Semistructured Data
- Orthogonal Range Queries in OLAP
- Reasoning about Summarizability in Heterogeneous Multidimensional Schemas
- Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
- Constraint-Based Clustering in Large Databases
- On the Surprising Behavior of Distance Metrics in High Dimensional Space
- On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces.