E-Books durchsuchen

Database Theory — ICDT 2001 [2001]

1
Expressive Power of SQL
22
Query Evaluation via Tree-Decompositions
39
Scalar Aggregation in FD-Inconsistent Databases
54
On Decidability and Complexity of Description Logics with Uniqueness Constraints
68
Expressiveness Issues and Decision Problems for Active Database Event Queries
83
A Theory of Transactions on Recoverable Search Trees
99
Minimizing View Sets without Losing Query-Answering Power
114
Cost Based Data Dissemination in Broadcast Networks
129
Parallelizing the Data Cube
144
Asymptotically Optimal Declustering Schemes for Range Queries
159
Flexible Data Cubes for Online Aggregation
174
Mining for Empty Rectangles in Large Data Sets
189
FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies
204
Axiomatization of Frequent Sets
219
On Answering Queries in the Presence of Limited Access Patterns
234
The Dynamic Complexity of Transitive Closure Is in DynTC°
248
Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls
263
A Semi-monad for Semi-structured Data (ICDT Version)
301
Algebraic Rewritings for Optimizing Regular Path Queries
316
Why and Where: A Characterization of Data Provenance
331
Subsumption for XML Types
346
Towards Aggregated Answers for Semistructured Data
361
Orthogonal Range Queries in OLAP
375
Reasoning about Summarizability in Heterogeneous Multidimensional Schemas
390
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
405
Constraint-Based Clustering in Large Databases
420
On the Surprising Behavior of Distance Metrics in High Dimensional Space
435
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Feedback