Frequent Elements with Witnesses in Data Streams
Summary: Introduce the "witness" frequent-elements problem: report frequent items together with ≥ d/α timestamps or meta-data witnesses. Give provably optimal space bounds: insertion-only Θ~(n + d·n^{1/α}) for 1≤α≤log n; insertion–deletion Θ~(n·d^2/α^2) for α≤√n. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 166 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00039361552 |
| 1,094 | Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems | 2011 | PODS | 0.00014129658 |
| 1,629 | Space-optimal Heavy Hitters with Strong Error Bounds | 2009 | PODS | 0.00011085267 |
| 6,418 | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems | 2016 | PODS | 5.0696932e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,833 | Streaming Algorithms for Robust Distinct Elements | 2016 | SIGMOD | 4.1945683e-05 |
| 10,983 | A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions | 2024 | SIGMOD | 4.1945683e-05 |
| 3,102 | Processing Set Expressions over Continuous Update Streams | 2003 | SIGMOD | 7.5586568e-05 |
| 2,759 | A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows | 2006 | PODS | 8.1636123e-05 |
| 1,629 | Space-optimal Heavy Hitters with Strong Error Bounds | 2009 | PODS | 0.00011085267 |
| 383 | An Optimal Algorithm for the Distinct Elements Problem | 2010 | PODS | 0.00024820873 |
| 8,594 | Stream Frequency over Interval Queries | 2019 | VLDB | 4.4891331e-05 |
| 166 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00039361552 |
| 6,418 | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems | 2016 | PODS | 5.0696932e-05 |
| 835 | Finding Frequent Items in Data Streams | 2008 | VLDB | 0.00016109621 |