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
- 1. Christian Konrad (University of Bristol)
BibTeX Citation
@inproceedings{konrad_pods21,
address = {New York, NY, USA},
series = {{PODS} '21},
title = {{Frequent Elements with Witnesses in Data Streams}},
url = {https://dl.acm.org/doi/10.1145/3452021.3458330},
doi = {10.1145/3452021.3458330},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Konrad, Christian},
year = {2021}
}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 |
|---|---|---|---|---|
| 122 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00031260115 |
| 777 | Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems | 2011 | PODS | 0.0001410593 |
| 1,600 | Space-optimal Heavy Hitters with Strong Error Bounds | 2009 | PODS | 0.00010240222 |
| 6,454 | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems | 2016 | PODS | 5.8746921e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,196 | A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions | 2024 | SIGMOD |
| 2 | 3,197 | Processing Set Expressions over Continuous Update Streams | 2003 | SIGMOD |
| 3 | 2,808 | A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows | 2006 | PODS |
| 4 | 1,600 | Space-optimal Heavy Hitters with Strong Error Bounds | 2009 | PODS |
| 5 | 8,603 | Stream Frequency over Interval Queries | 2019 | VLDB |
| 6 | 482 | An Optimal Algorithm for the Distinct Elements Problem | 2010 | PODS |
| 7 | 122 | Approximate Frequency Counts over Data Streams | 2002 | VLDB |
| 8 | 5,669 | Data Streams with Bounded Deletions | 2018 | PODS |
| 9 | 6,454 | An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems | 2016 | PODS |
| 10 | 885 | Finding Frequent Items in Data Streams | 2008 | VLDB |