Approximate Counts and Quantiles over Sliding Windows
Summary: Deterministic and randomized algorithms for ε-approximate frequency counts and quantiles over both fixed-size and adversarial variable-size sliding windows, using O((1/ε) polylog(1/ε,N)) space. Improves prior quantile bounds from O(1/ε^2) and gives the first space-efficient bounds for sliding-window frequency counts. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 32 of 32 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,133 | Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald | 2024 | PODS | 4.5740737e-05 |
| 4,950 | Optimal Bounds for Approximate Counting | 2022 | PODS | 5.808904e-05 |
| 274 | Approximate Medians and other Quantiles in One Pass and with Limited Memory | 1998 | SIGMOD | 0.00029383266 |
| 2,952 | Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams | 2006 | PODS | 7.8230109e-05 |
| 2,403 | Maintaining Variance and k–Medians over Data Stream Windows | 2003 | PODS | 8.8738166e-05 |
| 5,954 | A Tight Lower Bound for Comparison-Based Quantile Summaries | 2020 | PODS | 5.2542261e-05 |
| 4,969 | Relative Error Streaming Quantiles | 2021 | PODS | 5.790405e-05 |
| 12,444 | Variance Estimation over Sliding Windows | 2007 | PODS | 4.1905499e-05 |
| 126 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD | 0.00044753012 |
| 2,766 | A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows | 2006 | PODS | 8.1559016e-05 |