Integrating a maximum-entropy cardinality estimator into DB2 UDB

Authors:
Marcel Kutsch;Peter J. Haas;Volker Markl;Nimrod Megiddo;Tam Minh Tran
Affiliations:
IBM Boeblingen Laboratory, Boeblingen, Germany;IBM Almaden Research Center, San Jose, CA;IBM Almaden Research Center, San Jose, CA;IBM Almaden Research Center, San Jose, CA;IBM Silicon Valley Research Laboratory, San Jose, CA
Venue:
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Year:
2006

Citing 2
Cited 3

CORDS: automatic discovery of correlations and soft functional dependencies

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Consistently estimating the selectivity of conjuncts of predicates

VLDB '05 Proceedings of the 31st international conference on Very large data bases

Consistent selectivity estimation via maximum entropy

The VLDB Journal — The International Journal on Very Large Data Bases
Detecting attribute dependencies from query feedback

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Adaptive query processing

Foundations and Trends in Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

When comparing alternative query execution plans (qeps), a cost-based query optimizer in a relational database management system (rdbms) needs to estimate the selectivity of conjunctive predicates. The optimizer immediately faces a challenging problem: how to combine available partial information about selectivities in a consistent and comprehensive manner [1]. This paper describes a prototype solution to this problem.