DBScholar

Back to papers

Optimal and Approximate Computation of Summary Statistics for Range Aggregates

Summary: Algorithms to build histograms for arbitrary range-aggregate queries that are provably optimal or approximable (pseudo-polynomial time), extending beyond prior equality/prefix/hierarchical-only guarantees. Fast, provably-optimal wavelet-selection for range aggregates with experiments showing clear gains over prior methods. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1238
Venue
PODS
Year
2001
Pagerank
7.6057671e-05
Overall Rank
3,241 | 77.77%
DOI
10.1145/375551.375598

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gilbert_pods01,
        address = {New York, NY, USA},
        series = {{PODS} '01},
        title = {{Optimal and Approximate Computation of Summary Statistics for Range Aggregates}},
        url = {https://dl.acm.org/doi/10.1145/375551.375598},
        doi = {10.1145/375551.375598},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Gilbert, Anna C. and Kotidis, Yannis and Muthukrishnan, S. and Strauss, Martin J.},
        year = {2001}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers