Estimating the output cardinality of partial preaggregation with a measure of clusteredness

Authors:
Sven Helmer;Thomas Neumann;Guido Moerkotte
Affiliations:
Fakultät für Mathematik und Informatik, University of Mannheim, Germany;Fakultät für Mathematik und Informatik, University of Mannheim, Germany;Fakultät für Mathematik und Informatik, University of Mannheim, Germany
Venue:
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Year:
2003

Citing 27
Cited 1

Principles of database buffer management

ACM Transactions on Database Systems (TODS)
On estimating the cardinality of the projection of a database relation

ACM Transactions on Database Systems (TODS)
Statistical profile estimation in database systems

ACM Computing Surveys (CSUR)
An analytical cache model

ACM Transactions on Computer Systems (TOCS)
Index scans using a finite LRU buffer: a validated I/O model

ACM Transactions on Database Systems (TODS)
An approximate analysis of the LRU and FIFO buffer replacement schemes

SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
On estimating the size of projections

ICDT '90 Proceedings of the third international conference on database theory on Database theory
A survey of adaptive sorting algorithms

ACM Computing Surveys (CSUR)
Query evaluation techniques for large databases

ACM Computing Surveys (CSUR)
Extending the well-founded and valid semantics for aggregation

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Exact and approximate aggregation in constraint query languages

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards estimation error guarantees for distinct values

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Congressional samples for approximate answering of group-by queries

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Cache Memories

ACM Computing Surveys (CSUR)
Processing complex aggregate queries over data streams

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Domains and Active Domains: What This Distinction Implies for the Estimation of Projection Sizes in Relational Databases

IEEE Transactions on Knowledge and Data Engineering
Overcoming Limitations of Sampling for Aggregation Queries

Proceedings of the 17th International Conference on Data Engineering
Computing Iceberg Queries Efficiently

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Generalised Hash Teams for Join and Group-by

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Combining Histograms and Parametric Curve Fitting for Feedback-Driven Query Result-size Estimation

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Including Group-By in Query Optimization

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Eager Aggregation and Lazy Aggregation

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
On the Computation of Multidimensional Aggregates

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient Evaluation of Aggregates on Bulk Types

DBLP-5 Proceedings of the Fifth International Workshop on Database Programming Languages
Data Reduction by Partial Preaggregation

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Tree pattern aggregation for scalable XML data dissemination

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

Design patterns for scientific applications in DryadLINQ CTP

Proceedings of the second international workshop on Data intensive computing in the clouds

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new parameter, the clusteredness of data, and show how it can be used for estimating the output cardinality of a partial preaggregation operator. This provides the query optimizer with an important piece of information for deciding whether the application of partial preaggregation is beneficial. Experimental results are very promising, due to the high accuracy of the cardinality estimation based on our measure of clusteredness.