BPTree: an ℓ2 Heavy Hitters Algorithm Using Constant Memory
Summary: BPTree: an insertion-only ℓ2 heavy-hitters algorithm using O(ε^-2 log ε^-1) words and O(log ε^-1) update time, i.e., memory independent of n,m and optimal. Also provides O(ε^-2)-space ||f||_2 tracking; analysis via Dudley-style chaining for limited-independence Rademachers. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Vladimir Braverman (Johns Hopkins University)
- 2. Stephen R. Chestnut (ETH Zurich)
- 3. Nikita Ivkin (Johns Hopkins University)
- 4. Jelani Nelson (Harvard University)
- 5. Zhengyu Wang (Harvard University)
- 6. David P. Woodruff (IBM)
BibTeX Citation
@inproceedings{braverman_pods17,
address = {New York, NY, USA},
series = {{PODS} '17},
title = {{BPTree: an ℓ2 Heavy Hitters Algorithm Using Constant Memory}},
url = {https://dl.acm.org/doi/10.1145/3034786.3034798},
doi = {10.1145/3034786.3034798},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Braverman, Vladimir and Chestnut, Stephen R. and Ivkin, Nikita and Nelson, Jelani and Wang, Zhengyu and Woodruff, David P.},
year = {2017}
}
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 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 |
|---|---|---|---|---|
| 26 | Models and Issues in Data Stream Systems | 2002 | PODS | 0.00052121228 |
| 805 | Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems | 2011 | PODS | 0.00013794691 |
| 1,636 | Space-optimal Heavy Hitters with Strong Error Bounds | 2009 | PODS | 0.00010016656 |
| 4,550 | Approximate Frequency Counts over Data Streams | 2012 | VLDB | 6.5402546e-05 |
| 6,570 | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems | 2016 | PODS | 5.7458578e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,232 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |
| 2 | 10,388 | Unbiased Insights: Optimal Streaming Algorithms for l_p Sampling, the Forget Model, and Beyond | 2026 | PODS |
| 3 | 12,350 | Range Thresholding on Streams | 2016 | SIGMOD |
| 4 | 11,471 | Streaming Algorithms with Few State Changes | 2024 | PODS |
| 5 | 11,538 | A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions | 2024 | SIGMOD |
| 6 | 5,778 | Data Streams with Bounded Deletions | 2018 | PODS |
| 7 | 11,945 | Frequent Elements with Witnesses in Data Streams | 2021 | PODS |
| 8 | 1,636 | Space-optimal Heavy Hitters with Strong Error Bounds | 2009 | PODS |
| 9 | 9,719 | Finding Heavy-Hitters with Optimal State Changes | 2026 | PODS |
| 10 | 6,570 | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems | 2016 | PODS |