


































|
 |
|
ICDT - Papers
|
 |
Expressive Power of SQL
Query Evaluation via Tree-Decompositions
Scalar Aggregation in FD-Inconsistent Databases
On Decidability and Complexity of Description Logics with Uniqueness Constraints
Expressiveness Issues and Decision Problems for Active Database Event Queries
A Theory of Transactions on Recoverable Search Trees
Minimizing View Sets without Losing Query-Answering Power
Cost Based Data Dissemination in Broadcast Networks
Parallelizing the Data Cube
Asymptotically Optimal Declustering Schemes for Range Queries
Flexible Data Cubes for Online Aggregation
Mining for Empty Rectangles in Large Data Sets
FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies
Axiomatization of Frequent Sets
On Answering Queries in the Presence of Limited Access Patterns
The Dynamic Complexity of Transitive Closure Is in DynTC0
Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls
A Semi-monad for Semi-structured Data (ICDT-Version)
Algebraic Rewritings for Optimizing Regular Path Querie
Why and Where: A Characterization of Data Provenance
Subsumption for XML Types
Towards Aggregated Answers for Semistructured Data
Orthogonal Range Queries in OLAP
Reasoning about Summarizability in Heterogeneous Multidimensional Schemas
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
Constraint-Based Clustering in Large Databases
On the Surprising Behavior of Distance Metrics in High Dimensional Spaces
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Return to ICDT session listing
 DiSC'02 © 2003 Association for Computing Machinery |