Database Paper Browser

Back to papers

Estimating arbitrary subset sums with few probes

Summary: Preprocess items with weight-dependent random priorities so any subset sum can be estimated by probing only the q highest-priority items in the subset. Unbiased estimator with relative stddev O(1/√q) (hence O(1/ε^2) probes for 1±ε), no subset-size knowledge needed; can also estimate counts. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1365
Venue
PODS
Year
2005
Pagerank
5.8053317e-05
Overall Rank
4,955 | 65.53%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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
18 On Random Sampling over Joins 1999 SIGMOD 0.00092385438
184 New Sampling-Based Summary Statistics for Improving Approximate Query Answers 1998 SIGMOD 0.00036625711
429 The Aqua Approximate Query Answering System 1999 SIGMOD 0.00023476494
1,182 On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) 1999 PODS 0.00013455963
Previous Page 1 / 1 Next

Semantically Similar Papers