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
1330
Venue
PODS
Year
2004
Pagerank
0.00014927798
Overall Rank
691 | 95.27%
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
772 VerdictDB: Universalizing Approximate Query Processing 2018 SIGMOD 0.00014147905
885 Finding Frequent Items in Data Streams 2008 VLDB 0.00013419017
1,263 Resource Sharing in Continuous Sliding-Window Aggregates 2004 VLDB 0.00011425419
1,995 Database Learning: Toward a Database that Becomes Smarter Every Time 2017 SIGMOD 9.3403665e-05
2,576 Optimal Sampling from Sliding Windows 2009 PODS 8.3964437e-05
2,596 A Geometric Approach to Monitoring Threshold Functions Over Distributed Data Streams 2006 SIGMOD 8.3627764e-05
2,808 A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows 2006 PODS 8.1006881e-05
3,023 Persistent Data Sketching 2015 SIGMOD 7.8398269e-05
3,628 Space Complexity of Hierarchical Heavy Hitters in Multi-Dimensional Data Streams 2005 PODS 7.2428869e-05
3,765 Quantiles over Data Streams: An Experimental Study 2013 SIGMOD 7.1442477e-05
4,258 Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data 2004 SIGMOD 6.7994155e-05
4,285 Beyond Simple Aggregates: Indexing for Summary Queries 2011 PODS 6.7812351e-05
4,472 Relative Error Streaming Quantiles 2021 PODS 6.6810874e-05
4,989 Shape Sensitive Geometric Monitoring 2008 PODS 6.4106441e-05
5,184 KLL± Approximate Quantile Sketches over Dynamic Datasets 2021 VLDB 6.3283918e-05
5,216 Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors 2005 SIGMOD 6.3121293e-05
5,802 Time-Decaying Aggregates in Out-of-order Streams 2008 PODS 6.0843083e-05
6,060 Finding Global Icebergs over Distributed Data Sets 2006 PODS 5.9914746e-05
6,696 Matrix Sketching Over Sliding Windows 2016 SIGMOD 5.7985588e-05
7,797 Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives 2019 PODS 5.5422948e-05
7,936 Logging Every Footstep: Quantile Summaries for the Entire History 2010 SIGMOD 5.5181056e-05
8,005 Together is Better: Heavy Hitters Quantile Estimation 2023 SIGMOD 5.5080221e-05
8,247 Optimal Approximate Matrix Multiplication over Sliding Windows 2026 VLDB 5.4574671e-05
8,603 Stream Frequency over Interval Queries 2019 VLDB 5.4041343e-05
8,616 CoopStore: Optimizing Precomputed Summaries for Aggregation 2020 VLDB 5.4004741e-05
8,964 Modeling Skew in Data Streams 2006 SIGMOD 5.3433303e-05
9,374 Optimal Matrix Sketching over Sliding Windows 2024 VLDB 5.2755515e-05
10,487 Quantile Estimation with Duplicates 2026 SIGMOD 5.093636e-05
10,865 Approximation-First Timeseries Query At Scale 2025 VLDB 5.093636e-05
11,569 Efficient and Error-bounded Spatiotemporal Quantile Monitoring in Edge Computing Environments 2022 VLDB 5.093636e-05
12,363 FIFO Indexes for Decomposable Problems 2011 PODS 5.093636e-05
12,629 Variance Estimation over Sliding Windows 2007 PODS 5.093636e-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.0006567919
26 Models and Issues in Data Stream Systems 2002 PODS 0.00052982574
82 Space-Efficient Online Computation of Quantile Summaries 2001 SIGMOD 0.00036378991
122 Approximate Frequency Counts over Data Streams 2002 VLDB 0.00031260115
149 New Sampling-Based Summary Statistics for Improving Approximate Query Answers 1998 SIGMOD 0.00029226907
150 Query Processing, Resource Management, and Approximation in a Data Stream Management System 2003 CIDR 0.00029208207
261 Approximate Medians and other Quantiles in One Pass and with Limited Memory 1998 SIGMOD 0.00023097188
443 Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Datasets 1999 SIGMOD 0.00018373044
462 Sampling Large Databases for Association Rules 1996 VLDB 0.00018065337
838 What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically 2003 PODS 0.0001370404
2,218 Maintaining Variance and k–Medians over Data Stream Windows 2003 PODS 8.9331834e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

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