ACM SIGMOD Record · 1984 · 68 citations · 10 references
ComputingComputer ScienceMathematicsAlgorithmsSet TheoryNumber-theoretic Algorithms
We present a new method for estimating the number of tuples satisfying a condition of the type attribute rel constant, where rel is one of "=", ">", "<", "≥", "≤". Our method gives highly accurate, yet easy to compute, estimates. We store information about attribute values as a list of distribution steps (histograms where buckets, instead of having equal width, have equal height). These distribution steps provide an upper bound on the error when estimating the number of tuples satisfying a condition. The estimation error can be arbitrarily reduced by increasing the number of steps. We analyze desirable conditions that such estimates should satisfy. Based on the distribution steps, we derive a set of estimation formulas which minimize the worst-case error. We also present another set of formulas which reduce the average-case error. Finally, we show how to use sampling to compute a close approximation of the distribution steps very quickly. The major applications of our method are in query optimization and in answering statistical queries.
10
Access path selection in a relational database management system
Patricia G. Selinger, M. M. Astrahan, Donald D. Chamberlin et al. · 1979 · 2.2K citations
Human Behaviour and the Principle of Least Effort.
P. Sargant Florence, G. K. Zipf · The Economic Journal · 1950 · 1.2K citations
Approximating block accesses in database organizations
S. Bing Yao · Communications of the ACM · 1977 · 385 citations · Full text
Storage and access in relational data bases
Michael W. Blasgen, Kapali P. Eswaran · IBM Systems Journal · 1977 · 229 citations
Optimization of query evaluation algorithms
S. Bing Yao · ACM Transactions on Database Systems · 1979 · 167 citations · Full text