DBScholar

Back to papers

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)

Paper ID
hc410e4c2143123ee
Venue
PODS
Year
2004
Pagerank
0.00014608975
Overall Rank
710 | 95.23%
DOI
10.1145/1055558.1055598

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{arasu_pods04,
        address = {New York, NY, USA},
        series = {{PODS} '04},
        title = {{Approximate Counts and Quantiles over Sliding Windows}},
        url = {https://dl.acm.org/doi/10.1145/1055558.1055598},
        doi = {10.1145/1055558.1055598},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Arasu, Arvind and Manku, Gurmeet Singh},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 32 of 32 citing papers.

Rank Citing Paper Year Venue Pagerank
784 VerdictDB: Universalizing Approximate Query Processing 2018 SIGMOD 0.00014012614
909 Finding Frequent Items in Data Streams 2008 VLDB 0.00013125647
1,286 Resource Sharing in Continuous Sliding-Window Aggregates 2004 VLDB 0.0001119284
2,027 Database Learning: Toward a Database that Becomes Smarter Every Time 2017 SIGMOD 9.1618139e-05
2,624 Optimal Sampling from Sliding Windows 2009 PODS 8.2095532e-05
2,649 A Geometric Approach to Monitoring Threshold Functions Over Distributed Data Streams 2006 SIGMOD 8.1754974e-05
2,875 A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows 2006 PODS 7.9193665e-05
3,080 Persistent Data Sketching 2015 SIGMOD 7.6662346e-05
3,678 Quantiles over Data Streams: An Experimental Study 2013 SIGMOD 7.104636e-05
3,708 Space Complexity of Hierarchical Heavy Hitters in Multi-Dimensional Data Streams 2005 PODS 7.0812099e-05
4,348 Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data 2004 SIGMOD 6.6469144e-05
4,374 Beyond Simple Aggregates: Indexing for Summary Queries 2011 PODS 6.6300924e-05
4,564 Relative Error Streaming Quantiles 2021 PODS 6.5317429e-05
5,045 KLL± Approximate Quantile Sketches over Dynamic Datasets 2021 VLDB 6.3001279e-05
5,117 Shape Sensitive Geometric Monitoring 2008 PODS 6.2669323e-05
5,327 Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors 2005 SIGMOD 6.1783009e-05
5,917 Time-Decaying Aggregates in Out-of-order Streams 2008 PODS 5.9483023e-05
6,188 Finding Global Icebergs over Distributed Data Sets 2006 PODS 5.8571256e-05
6,832 Matrix Sketching Over Sliding Windows 2016 SIGMOD 5.6684547e-05
7,957 Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives 2019 PODS 5.4183555e-05
8,104 Logging Every Footstep: Quantile Summaries for the Entire History 2010 SIGMOD 5.3942942e-05
8,170 Together is Better: Heavy Hitters Quantile Estimation 2023 SIGMOD 5.3844369e-05
8,415 Optimal Approximate Matrix Multiplication over Sliding Windows 2026 VLDB 5.3350162e-05
8,764 Stream Frequency over Interval Queries 2019 VLDB 5.2828968e-05
8,776 CoopStore: Optimizing Precomputed Summaries for Aggregation 2020 VLDB 5.2800094e-05
9,128 Modeling Skew in Data Streams 2006 SIGMOD 5.2234555e-05
9,559 Optimal Matrix Sketching over Sliding Windows 2024 VLDB 5.1571823e-05
10,674 Quantile Estimation with Duplicates 2026 SIGMOD 4.9793485e-05
11,268 Approximation-First Timeseries Query At Scale 2025 VLDB 4.9793485e-05
11,878 Efficient and Error-bounded Spatiotemporal Quantile Monitoring in Edge Computing Environments 2022 VLDB 4.9793485e-05
12,654 FIFO Indexes for Decomposable Problems 2011 PODS 4.9793485e-05
12,919 Variance Estimation over Sliding Windows 2007 PODS 4.9793485e-05
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.

Rank Cited Paper Year Venue Pagerank
13 Mining Association Rules between Sets of Items in Large Databases 1993 SIGMOD 0.00064420972
26 Models and Issues in Data Stream Systems 2002 PODS 0.00052121228
83 Space-Efficient Online Computation of Quantile Summaries 2001 SIGMOD 0.00035978046
124 Approximate Frequency Counts over Data Streams 2002 VLDB 0.00030600691
152 Query Processing, Resource Management, and Approximation in a Data Stream Management System 2003 CIDR 0.0002867034
153 New Sampling-Based Summary Statistics for Improving Approximate Query Answers 1998 SIGMOD 0.00028633995
252 Approximate Medians and other Quantiles in One Pass and with Limited Memory 1998 SIGMOD 0.00023050233
450 Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Datasets 1999 SIGMOD 0.00018032912
473 Sampling Large Databases for Association Rules 1996 VLDB 0.00017673931
858 What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically 2003 PODS 0.000134266
2,260 Maintaining Variance and k–Medians over Data Stream Windows 2003 PODS 8.7353589e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 7,239 Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald 2024 PODS
2 4,004 Optimal Bounds for Approximate Counting 2022 PODS
3 252 Approximate Medians and other Quantiles in One Pass and with Limited Memory 1998 SIGMOD
4 2,750 Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams 2006 PODS
5 2,260 Maintaining Variance and k–Medians over Data Stream Windows 2003 PODS
6 5,320 A Tight Lower Bound for Comparison-Based Quantile Summaries 2020 PODS
7 4,564 Relative Error Streaming Quantiles 2021 PODS
8 12,919 Variance Estimation over Sliding Windows 2007 PODS
9 83 Space-Efficient Online Computation of Quantile Summaries 2001 SIGMOD
10 2,875 A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows 2006 PODS