A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows
Summary: Deterministic, distribution-free scheme for ε-approximate frequent items over sliding windows using a few short position-queues, emphasizing extreme simplicity. Achieves O(1/ε) update/query and O(1/ε) space (variable-size window: O((1/ε)·log(εn))). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
BibTeX Citation
@inproceedings{lee_pods06,
address = {New York, NY, USA},
series = {{PODS} '06},
title = {{A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows}},
url = {https://dl.acm.org/doi/10.1145/1142351.1142393},
doi = {10.1145/1142351.1142393},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Lee, L.K. and Ting, H.F.},
year = {2006}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 911 | Finding Frequent Items in Data Streams | 2008 | VLDB | 0.00013093314 |
| 5,932 | Time-Decaying Aggregates in Out-of-order Streams | 2008 | PODS | 5.9261324e-05 |
| 6,267 | Finding Frequent Items in Probabilistic Data | 2008 | SIGMOD | 5.8134046e-05 |
| 7,978 | Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives | 2019 | PODS | 5.3978826e-05 |
| 8,440 | Optimal Approximate Matrix Multiplication over Sliding Windows | 2026 | VLDB | 5.3148581e-05 |
| 8,792 | Stream Frequency over Interval Queries | 2019 | VLDB | 5.2629414e-05 |
| 9,592 | Optimal Matrix Sketching over Sliding Windows | 2024 | VLDB | 5.1376962e-05 |
| 10,688 | AeroSketch: Near-Optimal Time Matrix Sketch Framework for Persistent, Sliding Window, and Distributed Streams | 2026 | SIGMOD | 4.9605343e-05 |
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 |
|---|---|---|---|---|
| 153 | New Sampling-Based Summary Statistics for Improving Approximate Query Answers | 1998 | SIGMOD | 0.0002855087 |
| 316 | Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries | 2001 | VLDB | 0.00021238056 |
| 713 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS | 0.00014582248 |
| 860 | What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically | 2003 | PODS | 0.00013382689 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,592 | Optimal Matrix Sketching over Sliding Windows | 2024 | VLDB |
| 2 | 2,274 | Maintaining Variance and k–Medians over Data Stream Windows | 2003 | PODS |
| 3 | 82 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD |
| 4 | 12,967 | Variance Estimation over Sliding Windows | 2007 | PODS |
| 5 | 7,030 | SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model | 2022 | VLDB |
| 6 | 8,792 | Stream Frequency over Interval Queries | 2019 | VLDB |
| 7 | 124 | Approximate Frequency Counts over Data Streams | 2002 | VLDB |
| 8 | 11,995 | Frequent Elements with Witnesses in Data Streams | 2021 | PODS |
| 9 | 911 | Finding Frequent Items in Data Streams | 2008 | VLDB |
| 10 | 713 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS |