ACM Home Page
Please provide us with feedback. Feedback
Query size estimation by adaptive sampling (extended abstract)
Full text PdfPdf (773 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Nashville, Tennessee, United States
Pages: 40 - 46  
Year of Publication: 1990
ISBN:0-89791-352-3
Authors
Richard J. Lipton  Department of Computer Science, Princeton University
Jeffrey F. Naughton  Department of Computer Sciences, University of Wisconsin
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 61,   Citation Count: 29
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/298514.298540
What is a DOI?

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 ≤ in, 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

BKBR87
Chr83
 
Dem80
Robert Demolombe. Estimation of the number of tuples satisfying a query expressed in predicate calculus language. In Proceedings of the Sixth International Conference on Very Large Databases, pages 55-63, Montreal, Canada, 1980.
HOT88
 
LN89
 
Lyn88
 
MNS+87
Katherine Morris, Jeffrey F. Naughton, Yatin Saraiya, Jeffrey D. Ullman, and Allen Van Gelder. YAWN! (Yet Another Window on NAIL!). Database Engineering, December 1987.
 
MUVG86
 
NRSU89
 
OR86
PSC84
Row83
SAC+79
 
TZ86

CITED BY  29

Collaborative Colleagues:
Richard J. Lipton: colleagues
Jeffrey F. Naughton: colleagues