Bounding the cardinality of aggregate views through domain-derived constraints

Authors:
Paolo Ciaccia;Matteo Golfarelli;Stefano Rizzi
Affiliations:
DEIS, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy;DEIS, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy;DEIS, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
Venue:
Data & Knowledge Engineering - Special issue: Advances in OLAP
Year:
2003

Citing 13
Cited 1

Equi-depth multidimensional histograms

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Statistical profile estimation in database systems

ACM Computing Surveys (CSUR)
Statistical estimators for aggregate relational algebra queries

ACM Transactions on Database Systems (TODS)
On the complexity of finding bounds for projection cardinalities in relational databases

Information Systems - Data bases: their creation, management, and utilization
Implementing data cubes efficiently

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A general framework for the view selection problem for data warehouse design and evolution

Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
Analysis and performance of inverted data base structures

Communications of the ACM
Domains and Active Domains: What This Distinction Implies for the Estimation of Projection Sizes in Relational Databases

IEEE Transactions on Knowledge and Data Engineering
Index Selection for OLAP

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Selection of Views to Materialize in a Data Warehouse

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Fast Computation of Sparse Datacubes

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A Foundation for Multi-dimensional Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases

Efficient derivation of numerical dependencies

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Accurately estimating the cardinality of aggregate views is crucial for logical and physical design of data warehouses. This paper proposes an approach based on cardinality constraints, derived a-priori from the application domain, which may bound either the cardinality of a view or the ratio between the cardinalities of two views. We face the problem by first computing satisfactory bounds for the cardinality, then by capitalizing on these bounds to determine a good probabilistic estimate for it. In particular, we propose a bounding strategy which achieves an effective trade-off between the tightness of the bounds produced and the computational complexity.