DBScholar

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
1364
Venue
PODS
Year
2005
Pagerank
6.5196044e-05
Overall Rank
4,761 | 67.34%
DOI
10.1145/1065167.1065209

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{alon_pods05,
        address = {New York, NY, USA},
        series = {{PODS} '05},
        title = {{Estimating arbitrary subset sums with few probes}},
        url = {https://dl.acm.org/doi/10.1145/1065167.1065209},
        doi = {10.1145/1065167.1065209},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Alon, Noga and Duffield, Nick and Lund, Carsten and Thorup, Mikkel},
        year = {2005}
}

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
9 Online Aggregation 1997 SIGMOD 0.00077458002
54 On Random Sampling over Joins 1999 SIGMOD 0.00040810225
149 New Sampling-Based Summary Statistics for Improving Approximate Query Answers 1998 SIGMOD 0.00029226907
327 The Aqua Approximate Query Answering System 1999 SIGMOD 0.00021091539
1,529 On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) 1999 PODS 0.00010482997
Previous Page 1 / 1 Next

Semantically Similar Papers