## Database Theory - ICDT 2001: 8th International Conference London, UK, January 4-6, 2001 ProceedingsThis 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 database theory and the foundations of database systems are addressed. Among the topics covered are database queries, SQL, information retrieval, database logic, database mining, constraint databases, transactions, algorithmic aspects, semi-structured data, data engineering, XML, term rewriting, clustering, etc. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Expressive Power of SQL | 1 |

Query Evaluation via TreeDecompositions Extended Abstract | 22 |

Scalar Aggregation in FDInconsistent Databases | 39 |

On Decidability and Complexity of Description Logics with Uniqueness Constraints | 54 |

Expressiveness Issues and Decision Problems for Active Database Event Queries | 68 |

A Theory of Transactions on Recoverable Search Trees | 83 |

Minimizing View Sets without Losing QueryAnswering Power | 99 |

Cost Based Data Dissemination in Broadcast Networks | 114 |

The Dynamic Complexity of Transitive Closure Is in DynTC0 | 234 |

FirstOrder Logic FixedPoints and Convex Hulls | 248 |

A Semimonad for Semistructured Data ICDT Version | 263 |

Algebraic Rewritings for Optimizing Regular Path Queries | 301 |

A Characterization of Data Provenance | 316 |

Subsumption for XML Types | 331 |

Towards Aggregated Answers for Semistructured Data | 346 |

Orthogonal Range Queries in OLAP | 361 |

Parallelizing the Data Cube | 129 |

Asymptotically Optimal Declustering Schemes for Range Queries | 144 |

Flexible Data Cubes for Online Aggregation | 159 |

Mining for Empty Rectangles in Large Data Sets | 174 |

An E cient Algorithm for Mining Functional and Embedded Dependencies | 189 |

Axiomatization of Frequent Sets | 204 |

On Answering Queries in the Presence of Limited Access Patterns | 219 |

Reasoning about Summarizability in Heterogeneous Multidimensional Schemas | 375 |

A Probabilistic Approach | 390 |

ConstraintBased Clustering in Large Databases | 405 |

On the Surprising Behavior of Distance Metrics in High Dimensional Space | 420 |

On Optimizing Nearest Neighbor Queries in HighDimensional Data Spaces | 435 |

450 | |

### Other editions - View all

### Common terms and phrases

acyclic aggregate algebra algorithm applications attributes block broadcast clustering complete answer complexity classes compute conjunctive queries consider constraint databases contains cost data cube data item data mining data set data structure datacube datalog declustering scheme defined Definition denote dimensional disk distance metric DLClass edge elements equivalent evaluation event example expression finite first-order first-order logic formula function given graph high-dimensional ICDT input instance iteration l-rewriting Lemma logic matrix maximal minimal nearest neighbor search node NP-complete OLAP operation optimal output parameterized query partitioning path polynomial pre-aggregated prefix sum problem Proc proof PTIME query language query Q range queries rectangles recursive regular expressions relation relational algebra retrieve rewriting search-tree Section semistructured data sequence SIGMOD sm transactions split constraints storage subgoals subset subsumption technique Theorem transitive closure tree tuples update variables view set XML Schema