Selectivity estimation without the attribute value independence assumption

Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997

Volumn , Issue , 1997, Pages 486-495

  Poosala, Viswanath ^a   Ioannidis, Yannis E ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b University of Wisconsin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; LINEAR ALGEBRA;

ATTRIBUTE VALUES; COMMERCIAL SYSTEMS; DATA DISTRIBUTION; INDEPENDENCE ASSUMPTION; MULTI DIMENSIONAL; MULTI-DIMENSIONAL HISTOGRAMS; MULTIPLE ATTRIBUTES; SELECTIVITY ESTIMATION;

SINGULAR VALUE DECOMPOSITION;

EID: 84994070713     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. M. W. Berry. Private communication, 1997. CS dept, Univ. of Tennessee.
2. S. Christodoulakis. Implications of certain assumptions in database performance evaluation. ACM TODS, 9(2): 163186, June 1984.
3. J. G. Griffiths. An algorithm for displaying a class of space-filling curves. Software-Practice and Experience, 16(5):403-411,May 1984.
4. Y. Ioannidis. Universality of serial histograms. Proc. of the 19th Int. Conf. on Very Large Databases, pages 256-267, December 1993.
5. Y. Ioannidis and S. Christodoulakis. Optimal histograms for limiting worst-case error propagation in the size of join results. ACM TODS, 1993.
6. Y. Ioannidis and V. Poosala. Balancing histogram optimality and practicality for query result size estimation. Proc. of ACM SIGMOD Conf, pages 233-244, May 1995.
7. H. V. Jagadish. Linear clustering of objects with multiple attributes. Proc. of ACM SIGMOD Conf, pages 332-342, 1990.
8. I. Kamel and C. Faloutsos. Hilbert R-trees: an imporived R-tree using fractals. Proc. of the 20th Int. Conf. on Very Large Databases (VLDB), Santiago, Chile, pages 500-509, 1994.
9. R. P. Kooi. The optimization of queries in relational databases. PhD thesis, Case Western Reserver University, Sept 1980.
10. S. Leach. Singular value decomposition-a primer. Unpublished Manuscript, Department of Computer Science, Brown University, Providence, RI, USA.
11. R. J. Lipton, J. F. Naughton, and D. A. Schneider. Practical selectivity estimation through adaptive sampling. Proc. of ACM SIGMOD Conf, pages 1-11, May 1990.
12. M. Muralikrishna and D. J. Dewitt. Equi-depth histograms for estimating selectivity factors for multi-dimensional queries. Proc. of ACM SIGMOD Conf, pages 28-36,1988.
13. B. Muthuswamy and L. Kerschberg. A DDSM for relational query optimization. Proc. ACM Annual Conference, Oct 1985.
14. G. Piatetsky-Shapiro and C. Connell. Accurate estimation of the number of tuples satisfying a condition. Proc. of ACM SIGMOD Conf, pages 256-276,1984.
15. V. Poosala and Y. Ioannidis. Selectivity estimation without the attribute value independence assumption. Technical report. Bell Labs, 1997.
16. V. Poosala, Y. Ioannidis. P. Haas, and E. Shekita. Improved histograms for selectivity estimation of range predicates. Proc. of ACM SIGMOD Conf, pages 294-305, June 1996.
17. W. H. Press. Numerical recipes in C: The art of scientific computing. Cambridge University Press, 1988.
18. P. Seiinger, M. Astrahan, D. Chamberlin, R. Lorie, and T. Price. Access path selection in a relational database management system. Proc. of ACM SIGMOD Conf, pages 23-34, 1979.
19. W. Sun, Y. Ling, N. Rishe, and Y. Deng. An instant and accurate size estimation method for joins and selections in a retrieval-intensive environment. Proc. of ACM SIGMOD Conf, pages 79-88,1993.
20. G. K. Zipf. Human behaviour and the principle of least effort. Addison-Wesley, Reading, MA, 1949.