Affiliation:
1. University of Wisconsin--Madison
2. University of Washington, Seattle
Abstract
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, progress estimation, and resource provisioning. We study cardinality estimation in a principled framework: given a set of statistical assertions about the number of tuples returned by a fixed set of queries, predict the number of tuples returned by a new query. We model this problem using the probability space, over possible worlds, that satisfies all provided statistical assertions and maximizes entropy. We call this the Entropy Maximization model for statistics (MaxEnt). In this article we develop the mathematical techniques needed to use the MaxEnt model for predicting the cardinality of conjunctive queries.
Funder
Air Force Research Laboratory
Office of Naval Research
Division of Information and Intelligent Systems
Publisher
Association for Computing Machinery (ACM)
Reference35 articles.
1. Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison Wesley. Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison Wesley.
2. Tracking join and self-join sizes in limited storage
3. The space complexity of approximating the frequency moments
4. Alon N. and Spencer J. 1992. The Probabilistic Method. John Wiley. Alon N. and Spencer J. 1992. The Probabilistic Method. John Wiley.
5. World-Set Decompositions: Expressiveness and Efficient Algorithms
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献