Database Paper Browser

Back to papers

Analysis and Application of Adaptive Sampling

Summary: Links descriptive complexity to query-size estimation: some definable queries lack fast estimators, yet on bounded-degree structures every FO query has a fast adaptive-sampling estimator. Offers average-case analysis and improved upper bound for the original adaptive sampler, compares it to newer adaptive and Monte‑Carlo variants (incomparable), and shows adaptive sampling can beat Monte‑Carlo when data maxima are known. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1216
Venue
PODS
Year
2000
Pagerank
4.331052e-05
Overall Rank
9,523 | 33.76%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,827 Containment Join Size Estimation: Models and Methods 2003 SIGMOD 4.6411831e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
367 Sequential Sampling Procedures For Query Size Estimation 1992 SIGMOD 0.00025509745
688 Estimating the Size of Generalized Transitive Closures 1989 VLDB 0.00018134733
6,255 Queries are easier than you thought (probably) 1992 PODS 5.1367617e-05
Previous Page 1 / 1 Next

Semantically Similar Papers