Abstract

The result size of a query that involves multiple attributes from the same relation depends on these attributes’joinr data distribution, i.e., the frequencies of all combinations of attribute values. To simplify the estimation of that size, most commercial systems make the artribute value independenceassumption and maintain statistics (typically histograms) on individual attributes only. In reality, this assumption is almost always wrong and the resulting estimations tend to be highly inaccurate. In this paper, we propose two main alternatives to effectively approximate (multi-dimensional) joint data distributions. (a) Using a multi-dimensional histogram, (b) Using the Singular Value Decomposition (SVD) technique from linear algebra. An extensive set of experiments demonstrates the advantages and disadvantages of the two approaches and the benefits of both compared to the independence assumption. 1

Citations

1466	Numerical Recipes in C. The Art of Scientific Computing - PRESS, FLANNERY, et al. - 1988
435	Access path selection in a relational database management system - Selinger, Astrahan, et al. - 1979
254	Human Behaviour and the Principle of Least Effort - Zipf - 1949
211	Improved histograms for selectivity estimation of range predicates - Poosala, Ioannidis, et al. - 1996
174	Linear clustering of objects with multiple attributes - Jagadish - 1990
173	Equi-depth histograms for estimating selectivity factors for multi-dimensional queries - Muralikrishna, DeWitt - 1988
146	Practical selectivity estimation through adaptive sampling - Lipton, Naughton, et al. - 1990
134	Accurate estimation of the number of tuples satisfying a condition - Piatetsky-Shapiro, Connell - 1984
125	Balancing Histogram Optimality and Practicality for Query Result Size Estimation - Ioannidis, Poosala - 1995
80	Universality of serial histograms - Ioannidis - 1993
72	The optimization of queries in relational databases - KOOI - 1980
65	Implications of certain assumptions in database performance evauation - Christodoulakis - 1984
52	Optimal histograms for limiting worst-case error propagation in the size of join results - Ioannidis, Christodoulakis - 1993
28	An instant and accurate size estimation method for joins and selections in a retrieval-intensive environment - Sun, Ling, et al. - 1993
11	An algorithm for displaying a class of space-filling curves - Griffiths - 1986
8	private communication - Berry - 2000
5	A ddsm for relational query optimization - Muthuswamy, Kerschberg - 1985
1	Hilbert R-trees: an imporived R-tree using fractals - Kamel, Faloutsos - 1994
1	Singular value decomposition - a primer. Unpublished - Leach