DBScholar

Back to papers

Space-optimal Heavy Hitters with Strong Error Bounds

Summary: Shows FREQUENT/SpaceSaving get a tail guarantee: per-item error depends only on the L1 mass of the tail, not on top frequencies, making them space-optimal under this stronger bound. Implies O(k) space sparse recovery with near-optimal L1 error (improving O(k log n)) and gives guarantees for Zipfian data and mergeable summaries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1486
Venue
PODS
Year
2009
Pagerank
0.00010240222
Overall Rank
1,600 | 89.03%
DOI
10.1145/1559795.1559819

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{berinde_pods09,
        address = {New York, NY, USA},
        series = {{PODS} '09},
        title = {{Space-optimal Heavy Hitters with Strong Error Bounds}},
        url = {https://dl.acm.org/doi/10.1145/1559795.1559819},
        doi = {10.1145/1559795.1559819},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Berinde, Radu and Cormode, Graham and Indyk, Piotr and Strauss, Martin J.},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 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.

Previous Page 1 / 1 Next

Semantically Similar Papers