Space Complexity of Hierarchical Heavy Hitters in Multi-Dimensional Data Streams
Summary: Shows deterministic single-pass phi-HHHs in d-dimensional hierarchies require Omega(1/phi^(d+1)) space, explaining why prior O((1/phi) log(phi n)) schemes yield false positives. Provides a matching O(1/phi^(d+1)) algorithm that reports phi-HHHs without false positives. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,629 | Space-optimal Heavy Hitters with Strong Error Bounds | 2009 | PODS | 0.00011085267 |
| 3,566 | Fast Manhattan Sketches in Data Streams | 2010 | PODS | 6.9629443e-05 |
| 6,418 | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems | 2016 | PODS | 5.0696932e-05 |
| 8,522 | Differentially Private Hierarchical Heavy Hitters | 2024 | PODS | 4.4937074e-05 |
| 8,594 | Stream Frequency over Interval Queries | 2019 | VLDB | 4.4891331e-05 |
| 11,562 | Timely Reporting of Heavy Hitters using External Memory | 2020 | SIGMOD | 4.1945683e-05 |
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 |
|---|---|---|---|---|
| 43 | Models and Issues in Data Stream Systems | 2002 | PODS | 0.00072723062 |
| 166 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00039361552 |
| 848 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS | 0.0001597308 |
| 4,334 | Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data | 2004 | SIGMOD | 6.2798179e-05 |
| 5,016 | Finding Hierarchical Heavy Hitters in Data Streams | 2003 | VLDB | 5.7580375e-05 |
Previous
Page 1 / 1
Next