Database Paper Browser

Back to papers

Relational Confidence Bounds Are Easy With The Bootstrap*

Summary: Proposes a plug-in bootstrap to compute confidence bounds for relational queries over sampled or incomplete data. Easy for DB programmers, broadly applicable, and ready to be integrated into analytic DBMS to provide probabilistic guarantees for AQP. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3668
Venue
SIGMOD
Year
2005
Pagerank
7.4523397e-05
Overall Rank
3,167 | 77.97%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank Cited Paper Year Venue Pagerank
14 Online Aggregation 1997 SIGMOD 0.0010801504
59 Sampling-Based Estimation of the Number of Distinct Values of an Attribute 1995 VLDB 0.00064501896
92 Practical Selectivity Estimation through Adaptive Sampling 1990 SIGMOD 0.00051315959
217 Ripple Joins for Online Aggregation 1999 SIGMOD 0.00033536712
378 Towards Estimation Error Guarantees for Distinct Values 2000 PODS 0.0002497492
429 The Aqua Approximate Query Answering System 1999 SIGMOD 0.00023476494
1,255 Fixed-Precision Estimation of Join Selectivity 1993 PODS 0.00013024064
Previous Page 1 / 1 Next

Semantically Similar Papers