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)
Incoming Non-self Citations Over Time
Authors
- 1. Radu Berinde (Massachusetts Institute of Technology)
- 2. Graham Cormode (AT&T)
- 3. Piotr Indyk (Massachusetts Institute of Technology)
- 4. Martin J. Strauss (University of Michigan)
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 124 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00030600691 |
| 403 | Bottom-Up Computation of Sparse and Iceberg CUBEs | 1999 | SIGMOD | 0.0001910396 |
| 588 | Computing Iceberg Queries Efficiently | 1998 | VLDB | 0.00015906635 |
| 909 | Finding Frequent Items in Data Streams | 2008 | VLDB | 0.00013125647 |
| 1,874 | Efficient Computation of Iceberg Cubes with Complex Measures | 2001 | SIGMOD | 9.4579757e-05 |
| 3,708 | Space Complexity of Hierarchical Heavy Hitters in Multi-Dimensional Data Streams | 2005 | PODS | 7.0812099e-05 |
| 5,157 | Finding Hierarchical Heavy Hitters in Data Streams | 2003 | VLDB | 6.2494766e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,538 | A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions | 2024 | SIGMOD |
| 2 | 4,564 | Relative Error Streaming Quantiles | 2021 | PODS |
| 3 | 12,596 | Space-Efficient Estimation of Statistics over Sub-Sampled Streams | 2012 | PODS |
| 4 | 124 | Approximate Frequency Counts over Data Streams | 2002 | VLDB |
| 5 | 5,778 | Data Streams with Bounded Deletions | 2018 | PODS |
| 6 | 11,945 | Frequent Elements with Witnesses in Data Streams | 2021 | PODS |
| 7 | 12,467 | Resource-oriented Approximation for Frequent Itemset Mining from Bursty Data Streams | 2014 | SIGMOD |
| 8 | 7,697 | SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model | 2022 | VLDB |
| 9 | 3,708 | Space Complexity of Hierarchical Heavy Hitters in Multi-Dimensional Data Streams | 2005 | PODS |
| 10 | 6,570 | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems | 2016 | PODS |