Database theory - ICDT 2001. 8th international conference, London, GB, January 4--6, 2001. Proceedings (Q1591872)

The articles of this volume will be reviewed individually. The 6th conference 1997 has been reviewed (see Zbl 0878.68013). Indexed articles: \textit{Libkin, Leonid}, Expressive power of SQL, 1-21 [Zbl 1047.68582] \textit{Flum, Jörg; Frick, Markus; Grohe, Martin}, Query evaluation via tree-decompositions, 22-38 [Zbl 1047.68047] \textit{Arenas, Marcelo; Bertossi, Leopoldo; Chomicki, Jan}, Scalar aggregation in FD-inconsistent databases, 39-53 [Zbl 1047.68560] \textit{Khizder, Vitaliy L.; Toman, David; Weddell, Grant}, On decidability and complexity of description logics with uniqueness constraints, 54-67 [Zbl 1047.03506] \textit{Bailey, James; Mikulás, Szabolcs}, Expressiveness issues and decision problems for active database event queries, 68-82 [Zbl 1047.68561] \textit{Sippu, Seppo; Soisalon-Soininen, Eljas}, A theory of transactions on recoverable search trees, 83-98 [Zbl 1047.68589] \textit{Li, Chen; Bawa, Mayank; Ullman, Jeffrey D.}, Minimizing view sets without losing query-answering power, 99-113 [Zbl 1047.68579] \textit{Xu, Bo; Wolfson, Ouri; Chamberlain, Sam}, Cost based data dissemination in broadcast networks, 114-128 [Zbl 1047.68507] \textit{Dehne, Frank; Eavis, Todd; Hambrusch, Susanne; Rau-Chaplin, Andrew}, Parallelizing the data cube, 129-143 [Zbl 1047.68643] \textit{Sinha, Rakesh K.; Bhatia, Randeep; Chen, Chung-Min}, Asymptotically optimal declustering schemes for range queries, 144-158 [Zbl 1047.68588] \textit{Riedewald, Mirek; Agrawal, Divyakant; El Abbadi, Amr}, Flexible data cubes for online aggregation, 159-173 [Zbl 1047.68645] \textit{Edmonds, Jeff; Gryz, Jarek; Liang, Dongming; Miller, Renée J.}, Mining for empty rectangles in large data sets, 174-188 [Zbl 1047.68570] \textit{Novelli, Noël; Cicchetti, Rosine}, FUN: An efficient algorithm for mining functional and embedded dependencies, 189-203 [Zbl 1047.68584] \textit{Calders, Toon; Paredaens, Jan}, Axiomatization of frequent sets, 204-218 [Zbl 1047.68567] \textit{Li, Chen; Chang, Edward}, On answering queries in the presence of limited access patterns, 219-233 [Zbl 1047.68580] \textit{Hesse, William}, The dynamic complexity of transitive closure is in DynTC\(^0\), 234-247 [Zbl 1047.68574] \textit{Kreutzer, Stephan}, Query languages for constraint databases: First-order logic, fixed-points, and convex hulls, 248-262 [Zbl 1047.68051] \textit{Fernandez, Mary; Simeon, Jerome; Wadler, Philip}, A semi-monad for semi-structured data (ICDT version), 263-300 [Zbl 1047.68571] \textit{Grahne, Gösta; Thomo, Alex}, Algebraic rewritings for optimizing regular path queries, 301-315 [Zbl 1047.68573] \textit{Buneman, Peter; Khanna, Sanjeev; Tan, Wang-Chiew}, Why and where: A characterization of data provenance, 316-330 [Zbl 1047.68566] \textit{Kuper, Gabriel M.; Siméon, Jérôme}, Subsumption for XML types, 331-345 [Zbl 1047.68578] \textit{Meuss, Holger; Schulz, Klaus U.; Bry, François}, Towards aggregated answers for semistructured data, 346-360 [Zbl 1047.68557] \textit{Poon, Chung Keung}, Orthogonal range queries in OLAP, 361-374 [Zbl 1047.68558] \textit{Hurtado, Carlos A.; Mendelzon, Alberto O.}, Reasoning about summarizability in heterogeneous multidimensional schemas, 375-389 [Zbl 1047.68556] \textit{Buccafurri, Francesco; Furfaro, Filippo; Saccà, Domenico}, Estimating range queries using aggregate data with integrity constraints: A probabilistic approach, 390-404 [Zbl 1047.68565] \textit{Tung, Anthony K. H.; Han, Jiawei; Lakshmanan, V. S.; Ng, Raymond T.}, Constraint-based clustering in large databases, 405-419 [Zbl 1047.68594] \textit{Aggarwal, Charu C.; Hinneburg, Alexander; Keim, Daniel A.}, On the surprising behavior of distance metrics in high dimensional space, 420-434 [Zbl 1047.68038] \textit{Berchtold, Stefan; Böhm, Christian; Keim, Daniel; Krebs, Florian; Kriegel, Hans-Peter}, On optimizing nearest neighbor queries in high-dimensional data spaces, 435-449 [Zbl 1047.68563]