Query Size Estimation by Adaptive Sampling.
Richard J. Lipton, Jeffrey F. Naughton:
Query Size Estimation by Adaptive Sampling.
PODS 1990: 40-46@inproceedings{DBLP:conf/pods/LiptonN90,
author = {Richard J. Lipton and
Jeffrey F. Naughton},
title = {Query Size Estimation by Adaptive Sampling},
booktitle = {Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on
Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee},
publisher = {ACM Press},
year = {1990},
isbn = {0-89791-352-3},
pages = {40-46},
ee = {http://doi.acm.org/10.1145/298514.298540, db/conf/pods/LiptonN90.html},
crossref = {DBLP:conf/pods/90},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
We present an adaptive, random sampling algorithm
for estimating the size of general queries. The algorithm
can be used for any query Q over a database D
such that 1) for some n, the answer to Q can be partitioned
into n disjoint subsets Q1, Q2, ..., Qn, and
2) for 1 <= i <= n, the size of Qi is bounded by some function
b(D, Q), and 3) there is some algorithm by which
we can compute the size of Qi, where i is chosen randomly.
We consider the performance of the algorithm
on three special cases of the algorithm: join queries,
transitive closure queries, and general recursive Datalog queries.
Copyright © 1990 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98.
and ...
Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings.
and ...
Printed Edition
Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee.
ACM Press 1990, ISBN 0-89791-352-3
Contents
Journal Version
Richard J. Lipton, Jeffrey F. Naughton:
Query Size Estimation by Adaptive Sampling.
J. Comput. Syst. Sci. 51(1): 18-25(1995)
References
- [BKBR87]
- Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan:
Bounds on the Propagation of Selection into Logic Programs.
PODS 1987: 214-226
- [Chr83]
- Stavros Christodoulakis:
Estimating Block Transfers and Join Sizes.
SIGMOD Conference 1983: 40-54
- [Dem80]
- Robert Demolombe:
Estimation of the Number of Tuples Satisfying a Query Expressed in Predicate Calculus Language.
VLDB 1980: 55-63
- [HOT88]
- Wen-Chi Hou, Gultekin Özsoyoglu, Baldeo K. Taneja:
Statistical Estimators for Relational Algebra Expressions.
PODS 1988: 276-287
- [LN89]
- Richard J. Lipton, Jeffrey F. Naughton:
Estimating the Size of Generalized Transitive Closures.
VLDB 1989: 165-171
- [Lyn88]
- Clifford A. Lynch:
Selectivity Estimation and Query Optimization in Large Databases with Highly Skewed Distribution of Column Values.
VLDB 1988: 240-251
- [MNS+87]
- Katherine A. Morris, Jeffrey F. Naughton, Yatin P. Saraiya, Jeffrey D. Ullman, Allen Van Gelder:
YAWN! (Yet Another Window on NAIL!).
IEEE Data Eng. Bull. 10(4): 28-43(1987)
- [MUVG86]
- Katherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder:
Design Overview of the NAIL! System.
ICLP 1986: 554-568
- [NRSU89]
- Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman:
Argument Reduction by Factoring.
VLDB 1989: 173-182
- [OR86]
- Frank Olken, Doron Rotem:
Simple Random Sampling from Relational Databases.
VLDB 1986: 160-169
- [PSC84]
- Gregory Piatetsky-Shapiro, Charles Connell:
Accurate Estimation of the Number of Tuples Satisfying a Condition.
SIGMOD Conference 1984: 256-276
- [Row83]
- Neil C. Rowe:
Top-Down Statistical Estimation on a Database.
SIGMOD Conference 1983: 135-145
- [SAC+79]
- Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price:
Access Path Selection in a Relational Database Management System.
SIGMOD Conference 1979: 23-34
- [TZ86]
- Shalom Tsur, Carlo Zaniolo:
LDL: A Logic-Based Data Language.
VLDB 1986: 33-41
Copyright © Fri Mar 12 17:19:55 2010
by Michael Ley (ley@uni-trier.de)