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
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 835 | Finding Frequent Items in Data Streams | 2008 | VLDB | 0.00016109621 |
| 5,594 | Time-Decaying Aggregates in Out-of-order Streams | 2008 | PODS | 5.4192122e-05 |
| 5,796 | Finding Frequent Items in Probabilistic Data | 2008 | SIGMOD | 5.3240234e-05 |
| 6,755 | Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives | 2019 | PODS | 4.9383139e-05 |
| 7,929 | Optimal Approximate Matrix Multiplication over Sliding Windows | 2026 | VLDB | 4.613363e-05 |
| 8,594 | Stream Frequency over Interval Queries | 2019 | VLDB | 4.4891331e-05 |
| 9,215 | Optimal Matrix Sketching over Sliding Windows | 2024 | VLDB | 4.3716847e-05 |
| 10,138 | AeroSketch: Near-Optimal Time Matrix Sketch Framework for Persistent, Sliding Window, and Distributed Streams | 2026 | SIGMOD | 4.1945683e-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 |
|---|---|---|---|---|
| 184 | New Sampling-Based Summary Statistics for Improving Approximate Query Answers | 1998 | SIGMOD | 0.00036625711 |
| 344 | Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries | 2001 | VLDB | 0.00026702512 |
| 848 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS | 0.0001597308 |
| 865 | What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically | 2003 | PODS | 0.00015808172 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,215 | Optimal Matrix Sketching over Sliding Windows | 2024 | VLDB | 4.3716847e-05 |
| 2,404 | Maintaining Variance and k–Medians over Data Stream Windows | 2003 | PODS | 8.8837279e-05 |
| 126 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD | 0.00044744986 |
| 12,435 | Variance Estimation over Sliding Windows | 2007 | PODS | 4.1945683e-05 |
| 8,203 | SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model | 2022 | VLDB | 4.5596344e-05 |
| 8,594 | Stream Frequency over Interval Queries | 2019 | VLDB | 4.4891331e-05 |
| 166 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00039361552 |
| 11,440 | Frequent Elements with Witnesses in Data Streams | 2021 | PODS | 4.1945683e-05 |
| 835 | Finding Frequent Items in Data Streams | 2008 | VLDB | 0.00016109621 |
| 848 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS | 0.0001597308 |