The efficiency of histogram-like techniques for database query optimization

Computer Journal

Volumn 45, Issue 5, 2002, Pages 494-510

  Oommen, B John ^a   Rueda, Luis G ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; NORMAL DISTRIBUTION; OPTIMIZATION; PROBLEM SOLVING;

DATABASE QUERY OPTIMIZATION; HISTOGRAMS;

QUERY LANGUAGES;

EID: 0036397353     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/45.5.494     Document Type: Review

References (32)

1. Oommen, B.J. and Rueda, L. (2002) A formal analysis of why heuristic functions work. Artificial Intell. To appear.
2. Ioannidis, Y. and Christodoulakis, S. (1991) On the propagation of errors in the size of join results. Proc. ACM-SIGMOD Conf., pp. 268-277.
3. Christodoulakis, S. (1983) Estimating block transfers and join sizes. ACM SIGMOD 83, Proc. Ann. Meeting, San Jose, CA, May, pp. 40-54.
4. Christodoulakis, S. (1983) Estimating record selectivities. Inf. Syst., 8, 105-115.
5. Faloutsos, C., Matias, Y. and Silberschatz, A. (1996) Modeling skewed distributions using multifractals and the 80-20 law. In Vijayaraman, T., Buchmann, A., Mohan, C. and Sarda, N. (eds), Proc. 22nd Int. Conf. on Very Large Databases (VLDB), pp. 307-317. Morgan Kaufmann.
6. Kooi, R. (1980) The Optimization of Queries in Relational Databases. PhD Thesis, Case Western Reserve University.
7. Mannino, M., Chu, P. and Sager, T. (1988) Statistical profile estimation in database systems. ACM Comput. Surveys, 20, 192-221.
8. Muralikrishna, M. and Dewitt, D. (1988) Equi-depth histograms for estimating selectivity factors for multi-dimensional queries. In Proc. ACM-SIGMOD Conf., pp. 28-36.
9. Piatetsky-Shapiro, G. and Connell, C. (1984) Accurate estimation of the number of tuples satisfying a condition. In Proc. ACM-SIGMOD Conf., pp. 256-276.
10. Selinger, P., Astrahanand, M., Chamberlin, M., Lorie, R. and Price, T. (1979) Access path selection in a relational database management system. In Proc. ACM-SIGMOD Conf., pp. 23-34.
11. Christodoulakis, S. (1981) Estimating Selectivities In Databases. Technical Report CSRG-136, Computer Science Department, University of Toronto, Toronto, Canada.
12. Oommen, B.J. and Thiyagarajah, M. (1999) The rectangular attribute cardinality map: a new histogram-like technique for query optimization. In Proc. Int. Database Engng. Applic. Symp., IDEAS'99, August, Montreal, Canada, pp. 3-15.
13. Oommen, B.J. and Thiyagarajah, M. (1999) The Rectangular Attribute Cardinality Map: A New Histogram-Like Technique For Query Optimization. Technical Report TR-99-01, School of Computer Science, Carleton University, Ottawa, Canada.
14. Thiyagarajah, M. (1999) Attribute Cardinality Maps: New Query Result Size Estimation Techniques for Database Systems. PhD Thesis, School of Computer Science, Carleton Univeristy, Ottawa, Canada.
15. Oommen, B.J. and Thiyagarajah, M. (2000) The trapezoidal attribute cardinality map: a new histogram-like technique for query optimization. In Proc. Int. Database Engng. Applic. Symp., IDEAS'2000, September, Yokohama, Japan, pp. 236-242.
16. Oommen, B.J. and Thiyagarajah, M. (1999) The Trapezoidal Attribute Cardinality Map: A New Histogram-Like Technique For Query Optimization. Technical Report TR-99-04, School of Computer Science, Carleton University, Ottawa, Canada.
17. Jagadish, H., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K. and Suel, T. (1998) Optimal histograms with quality guarantees. In Proc. Int. Conf. on Very Large Databases, pp. 275-286.
18. Poosala, V. and Ioannidis, Y. (1997) Selectivity estimation without the attribute value independence assumption. In Proc. 23rd. Int. Conf. on Very Large Databases, August, Athens, Greece, pp. 486-495.
19. Poosala, V., Ioannidis, Y., Haas, P. and Shekita, E. (1996) Improved histograms for selectivity estimation of range queries. In Proc. ACM SIGMOD Conf. on Management of Data, pp. 294-305.
20. Poosala, W. (1997) Histogram Based Estimation Techniques in Databases. PhD Thesis, University of Wisconsin, Madison.
21. Chakrabarti, K., Garofalakis, M., Rastogi, R. and Shim, K. (2000) Approximate query processing using wavelets. In Proc. 26th Int. Conf. on Very Large Databases, September, Cairo, Egypt, pp. 111-122.
22. Matias, Y., Vitter, J. and Wang, M. (1998) Wavelet-based histograms for selectivity estimation. In Proc. ACM SIGMOD Conf. on Management of Data, pp. 448-459.
23. Ibaraki, T. and Kameda, T. (1984) On the optimal nesting order for computing n-relational joins. ACM Transactions on Database Systems, 9, 482-502.
24. Cluet, S. and Moerkotte, G. (1995) On the complexity of generating optimal left-deep processing trees with cartesian products. In Proc. Int. Conf. on Databases Theory, Prague, pp. 54-67.
25. Scheufele, W. and Moerkotte, G. (1997) On the complexity of generating optimal plans with cross products. In Proc. 16th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Tucson, AZ, pp. 238-248.
26. Krishnamurthy, R., Boral, H. and Zaniolo, C. (1986) Optimization of nonrecursive queries. In Proc. 12th Int. Conf. on Very Large Databases, Kyoto, Japan, pp. 128-137.
27. Duda, R., Hart, P. and Stork, D. (2000) Pattern Classification (2nd edn). Wiley, New York.
28. Fukunaga, K. (1990) Introduction to Statistical Pattern Recognition. Academic Press, Boston.
29. Nguyen, T. and Oommen, B.J. (1997) Moment-preserving piecewise linear approximations of signals and images. IEEE Trans. Pattern Anal. Machine Intell., 19, 84-91.
30. Goswami, J. and Chan, A. (1999) Fundamentals of Wavelets: Theory, Algorithms, and Applications (Microwave and Optical Engineering Series). Wiley, New York.
31. Deeba, E. and Gunawardena, A. (1997) Interactive Linear Algebra with MAPLE V. Springer, New York.
32. Oommen, B.J. and Rueda, L. (2001) The Efficiency of Modern-Day Histogram-Like Techniques for Query Optimization. Technical Report TR-01-06, School of Computer Science, Carleton University, Ottawa, Canada.