I C D T 2001

The 8th International Conference on Database Theory

WEDNESDAY JANUARY 3rd
17:00--19:00	ICDT registration
THURSDAY JANUARY 4th
08:30--09:00	ICDT registration
09:00--09:10	Welcome address
Invited Talk 09.10--10.10	Expressive power of SQL (Leonid Libkin)
Paper session 10.10--10.40	Query evaluation via tree-decompositions (Joerg Flum, Markus Frick, Martin Grohe)
10:40--11:00	Coffee Break
Paper session 11:00--12.30	Scalar aggregation in FD-inconsistent databases (Marcelo Arenas, Leopoldo Bertossi, Jan Chomicki)
	On decidability and complexity of description logics with uniqueness constraints (Vitaliy L. Khizder, David Toman, Grant Weddell)
	Expressiveness issues and decision problems for active database event queries (James Bailey, Szabolcs Mikulas)
12:30--14:30	Lunch
Paper session 14:30--16:00	A theory of transactions on recoverable search trees (Seppo Sippu, Eljas Soisalon-Soininen)
	Minimizing view sets without losing query-answering power (Chen Li, Mayank Bawa, Jeffrey D. Ullman)
	Cost based data dissemination in broadcast networks (Bo Xu, Ouri Wolfson, Sam Chamberlain)
16:00--16:30	Coffee Break
Paper Session 16.30--18:00	Parallelizing the data cube (Frank Dehne, Todd Eavis, Susanne Hambrusch, Andrew Rau-Chaplin)
	Asymptotically optimal declustering schemes for range queries (Rakesh K. Sinha, Randeep Bhatia, Chung-Min Chen)
	Flexible data cubes for online aggregation (Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi)
19:00	Welcome reception at Senate House Welcome address by Professor Dr Jan Paredaens

FRIDAY JANUARY 5th
Invited Talk 9:00--10:00	The explosive growth of unstructured search (Andrei Broder)
10:00--10:30	Coffee Break
Paper Session 10.30--12:00	Mining for empty rectangles in large data sets (Jeff Edmonds, Jarek Gryz, Dongming Liang, Renee J. Miller)
	FUN: an efficient algorithm for mining functional and embedded dependencies (Noel Novelli, Rosine Cicchetti)
	Axiomatization of frequent sets (Toon Calders, Jan Paredaens)
12:00--14:00	Lunch
Paper Session 14:00-15.30	On answering queries in the presence of limited access patterns (Chen Li, Edward Chang)
	The dynamic complexity of transitive closure is in Dyn-TC0 (William Hesse)
	Query languages for constraint databases: first-order logic, fixed-points, and convex hulls (Stephan Kreutzer)
Excursion 15:30	Visit to the Tower of London and a tour of London followed by conference dinner.

SATURDAY JANUARY 6th
Invited Talk 9:00--10.00	A semi-monad for semi-structured data (Philip Wadler)
Paper session 10.00--10.30	Algebraic rewritings for optimizing regular path queries (Gosta Grahne, Alex Thomo)
10:30--11:00	Coffee Break
Paper session 11:00--12.30	Why and where: a characterization of data provenance (Peter Buneman, Sanjeev Khanna, Wang-Chiew Tan)
	Subsumption for XML types (Gabriel M. Kuper, Jerome Simeon)
	Towards aggregated answers for semi-structured data (Holger Meuss, Klaus U. Schulz, Francois Bry)
12:30--14:30	Lunch
Paper session 14.30--16:00	Best newcomer award paper: Orthogonal range queries in OLAP (Chung Keung Poon)
	Reasoning about summarizability in heterogeneous multidimensional schemas (Carlos A. Hurtado, Alberto O. Mendelzon)
	Estimating range queries using aggregate data with integrity constraints: a probabilistic approach (Francesco Buccafurri, Filippo Furfaro, Domenico Sacca)
16:00--16:30	Coffee break
Paper Session 16.30--18.00	Constraint-based clustering in large databases (Anthony K.H. Tung, Jiawei Han, Raymond T. Ng, Laks V.S. Lakshmanan)
	On the surprising behavior of distance metrics in high dimensional spaces (Charu C. Aggarwal, Alexander Hinneburg, Daniel A. Keim)
	On optimizing nearest neighbor queries in high-dimensional data spaces (Stefan Berchtold, Christian Boehm, Daniel A. Keim, Florian Krebs, Hans-Peter Kriegel)