8. ICDT 2001: London, UK

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