Selectivity estimation using probabilistic models

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 30, Issue 2, 2001, Pages 461-472

  Getoor, Lise ^a   Taskar, Ben ^a   Koller, Daphne ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039561484     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/376284.375727     Document Type: Article

References (27)

1. S. Acharya, P. Gibbons, V. Poosala, and S. Ramaswamy. Join synopses for approximate query answering. In SIGMOD. ACM Press, 1999.
2. D. Barbara, W. DuMouchel, C. Faloutsos, P. Haas, J. Hellerstein, Y. Ioannidis, H. Jagadish, T. Johnson, R. Ng, V. Poosala, K. Ross, and K. Sevcik. The New Jersey data reduction report. Data Engineering Bulletin, 20(4), 1997.
3. M.A. Behr, M.A. Wilson, W.P. Gill, H. Salamon, G.K. Schoolnik GK, S. Rane S, and P.M. Small. Comparative genomics of BCG vaccines by whole genome DNA microarray. Science, 284, 1999.
4. P. Berka. PKDD99 discovery challenge. http://lisp.vse.cz/pkdd99/chall.htm, 1999.
5. U.S. Census Bureau. Census bureau databases. http://www.census.gov.
6. K. Chakrabarti, M. Garofalakis, R. Rastogi, and K. Shim. Approximate query processing using wavelets. In VLDB. Morgan Kaufmann, 2000.
7. D. M. Chickering. Learning Bayesian networks is NP-complete. In Learning from Data: Artificial Intelligence and Statistics V. Springer Verlag, 1996.
8. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
9. M. desJardins, L. Getoor, and D. Koller. Using feature hierarchies in bayesian network learning. Lecture Notes in Artificial Intelligence, 1864, 2000.
10. D. Dey and S. Sarkar. A probabilistic relational model and algebra. TODS, 21(3), 1996.
11. N. Friedman, L. Getoor, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In Proc. IJCAI, 1999.
12. N. Friedman and M. Goldszmidt. Discretization of continuous attributes while learning Bayesian networks. In Proc. ICML, 1996.
13. N. Friedman and M. Goldszmidt. Sequential update of Bayesian network structure. In Proc. UAI, 1997.
14. N. Fuhr. A probabilistic relational model for the integration of ir and databases. In ACM-SIGIR. ACM, 1993.
15. D. Heckerman. A tutorial on learning with Bayesian networks. In M. I. Jordan, editor, Learning in Graphical Models. MIT Press, Cambridge, MA, 1998.
16. D. Heckerman, J. Breese, and K. Rommelse. Troubleshooting under uncertainty. Technical Report MSR-TR-94-07, Microsoft Research, 1994.
17. M. I. Jordan, editor. Learning in Graphical Models. Kluwer, Dordrecht, Netherlands, 1998.
18. D. Koller and A. Pfeffer. Probabilistic frame-based systems. In Proc. AAAI, 1998.
19. S. L. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, B 50(2), 1988.
20. R. Lipton, J. Naughton, and D. Schneider. Practical selectivity estimation through adaptive sampling. In SIGMOD. ACM Press, 1990.
21. Y. Matias, J. Vitter, and M. Wang. Wavelet-based histograms for selectivity estimation. In SIGMOD. ACM Press, 1998.
22. S. Monti and G. Cooper. A multivariate discretization method for learning Bayesian networks from data. In Proc. UAI, 1998.
23. M. Muralikrishna and D. Dewitt. Equi-depth histograms for estimating selectivity factors for multi-dimensionnal queries. In SIGMOD. ACM Press, 1988.
24. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
25. V. Poosala and Y. Ioannidis. Selectivity estimation without the attribute value independence assumption. In VLDB. Morgan Kaufmann, 1997.
26. M. Pradhan, G.M. Provan, B. Middleton, and M. Henrion. Knowledge engineering for large belief networks. In Proc. UAI, 1994.
27. J. Vitter and M. Wang. Approximate computation of multidimensional aggregates of sparse data using wavelets. In SIGMOD. ACM Press, 1999.