Proceedings of the 8th International Conference on Database Theory (ICDT), London, UK, 2001

Original publisher: Springer Verlag, LNCS - Lecture Notes in Computer Science, Volume: 1973, ISBN: 3-540-41456-8, Electronic Edition

Research Sessions

Single Track
[DOI] Expressive Power of SQL.
Leonid Libkin   pp. 1-21
[DOI] Query Evaluation via Tree-Decompositions.
Jörg Flum, Markus Frick, Martin Grohe   pp. 22-38
[DOI] Scalar Aggregation in FD-Inconsistent Databases.
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki   pp. 39-53
[DOI] On Decidability and Complexity of Description Logics with Uniqueness Constraints.
Vitaliy L. Khizder, David Toman, Grant E. Weddell   pp. 54-67
[DOI] Expressiveness Issues and Decision Problems for Active Database Event Queries.
James Bailey, Szabolcs Mikulás   pp. 68-82
[DOI] A Theory of Transactions on Recoverable Search Trees.
Seppo Sippu, Eljas Soisalon-Soininen   pp. 83-98
[DOI] Minimizing View Sets without Losing Query-Answering Power.
Chen Li, Mayank Bawa, Jeffrey D. Ullman   pp. 99-113
[DOI] Cost Based Data Dissemination in Broadcast Networks with Disconnection.
Bo Xu, Ouri Wolfson, Sam Chamberlain   pp. 114-128
[DOI] Parallelizing the Data Cube.
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin   pp. 129-143
[DOI] Asymptotically Optimal Declustering Schemes for Range Queries.
Rakesh K. Sinha, Randeep Bhatia, Chung-Min Chen   pp. 144-158
[DOI] Flexible Data Cubes for Online Aggregation.
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi   pp. 159-173
[DOI] Mining for Empty Rectangles in Large Data Sets.
Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller   pp. 174-188
[DOI] FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies.
Noel Novelli, Rosine Cicchetti   pp. 189-203
[DOI] Axiomatization of Frequent Sets.
Toon Calders, Jan Paredaens   pp. 204-218
[DOI] On Answering Queries in the Presence of Limited Access Patterns.
Chen Li, Edward Y. Chang   pp. 219-233
[DOI] The Dynamic Complexity of Transitive Closure Is In DynTC.
William Hesse   pp. 234-247
[DOI] Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls.
Stephan Kreutzer   pp. 248-262
[DOI] A Semi-monad for Semi-structured Data.
Mary F. Fernández, Jérôme Siméon, Philip Wadler   pp. 263-300
[DOI] Algebraic Rewritings for Optimizing Regular Path Queries.
Gösta Grahne, Alex Thomo   pp. 301-315
[DOI] Why and Where: A Characterization of Data Provenance.
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan   pp. 316-330
[DOI] Subsumption for XML types.
Gabriel M. Kuper, Jérôme Siméon   pp. 331-345
[DOI] Towards Aggregated Answers for Semistructured Data.
Holger Meuss, Klaus U. Schulz, François Bry   pp. 346-360
[DOI] Orthogonal Range Queries in OLAP.
Chung Keung Poon   pp. 361-374
[DOI] Reasoning about Summarizability in Heterogeneous Multidimensional Schemas.
Carlos A. Hurtado, Alberto O. Mendelzon   pp. 375-389
[DOI] Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach.
Francesco Buccafurri, Filippo Furfaro, Domenico Saccà   pp. 390-404
[DOI] Constraint-based clustering in large databases.
Anthony K. H. Tung, Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han   pp. 405-419
[DOI] On the Surprising Behavior of Distance Metrics in High Dimensional Spaces.
Charu C. Aggarwal, Alexander Hinneburg, Daniel A. Keim   pp. 420-434
[DOI] On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces.
Stefan Berchtold, Christian Böhm, Daniel A. Keim, Florian Krebs, Hans-Peter Kriegel   pp. 435-449
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