Lightweight graphical models for selectivity estimation without independence assumptions

Proceedings of the VLDB Endowment

Volumn 4, Issue 11, 2011, Pages 852-863

  Tzoumas, Kostas ^a   Deshpande, Amol ^b   Jensen, Christian S ^c  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF MARYLAND   (United States)

^c AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

INDUSTRIAL RESEARCH; PROBABILITY DISTRIBUTIONS; QUERY PROCESSING;

ESTIMATION ERRORS; GRAPHICAL MODEL; INDEPENDENCE ASSUMPTION; INDUSTRIAL DEVELOPMENT; OPTIMISATIONS; OPTIMIZERS; QUERY OPTIMIZER; RESEARCH DEVELOPMENT; SELECTIVITY ESTIMATION; STATISTICAL SUMMARY;

GRAPHIC METHODS;

EID: 84862607323     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/3402707.3402724     Document Type: Conference Paper

References (18)

1. S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy Join synopses for approximate query answering. In SIGMOD, pp. 275-286, 1999.
2. A. Berry, J. R. S. Blair, P. Heggernes, and B. W. Peyton Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica, 39(4):287-298, 2004.
3. C. K. Chow and C. N. Liu Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14(3):462467, 1968.
4. R. G. Cowell, P. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter Probabilisitc Networks and Expert Systems: Exact Computational Methods for Bayesian Networks. Springer, 1999.
5. A. Deshpande, M. N. Garofalakis, and M. I. Jordan Efficient stepwise selection in decomposable models. In UAI, pp. 128-135, 2001.
6. A. Deshpande, M. N. Garofalakis, and R. Rastogi Independence is good: Dependency-based histogram synopses for high-dimensional data. In SIGMOD, pp. 199-210, 2001.
7. L. Getoor, B. Taskar, and D. Koller Selectivity estimation using probabilistic models. In SIGMOD, pp. 461-472, 2001.
8. I. F. Ilyas, V. Markl, P. J. Haas, P. Brown, and A. Aboulnaga CORDS: Automatic discovery of correlations and soft functional dependencies. In SIGMOD, pp. 647-658, 2004.
9. Y. E. Ioannidis The history of histograms (abridged). In VLDB, pp. 19-30, 2003.
10. Y. E. Ioannidis and S. Christodoulakis On the propagation of errors in the size of join results. In SIGMOD, pp. 268-277, 1991.
11. F. V. Jensen and F. Jensen Optimal junction trees. In UAI, pp. 360-366, 1994.
12. H. Kimura, G. Huo, A. Rasin, S. Madden, and S. B. Zdonik CORADD: Correlation aware database designer for materialized views and indexes. PVLDB, 3(1):1103-1113, 2010.
13. Y. Matias, J. S. Vitter, and M. Wang Wavelet-based histograms for selectivity estimation. In SIGMOD, pp. 448-459, 1998.
14. G. Moerkotte, T. Neumann, and G. Steidl Preventing bad plans by bounding the impact of cardinality estimation errors. PVLDB, 2(1):982-993, 2009.
15. V. Poosala and Y. E. Ioannidis Selectivity estimation without the attribute value independence assumption. In VLDB, pp. 486-495, 1997.
16. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price Access path selection in a relational database management system. In SIGMOD, pp. 23-34, 1979.
17. J. Spiegel and N. Polyzotis Graph-based synopses for relational selectivity estimation. In SIGMOD, pp. 205-216, 2006.
18. K. Tzoumas, A. Deshpande, and C. S. Jensen Sharing-aware horizontal partitioning for exploiting correlations during query processing. PVLDB, 3(1):542-553, 2010.