Space-Efficient Online Computation of Quantile Summaries
Summary: Online algorithm for epsilon-approximate quantile summaries on streaming data, with worst-case space O((1/epsilon) log(epsilon N)). Improves upon O((1/epsilon) log^2(epsilon N); requires no a priori knowledge of N; experiments show space tighter than both worst-case and prior methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael Greenwald (University of Pennsylvania)
- 2. Sanjeev Khanna (University of Pennsylvania)
BibTeX Citation
@inproceedings{greenwald_sigmod01,
title = {{Space-Efficient Online Computation of Quantile Summaries}},
author = {Greenwald, Michael and Khanna, Sanjeev},
series = {{SIGMOD} '01},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/375663.375670},
url = {https://dl.acm.org/doi/10.1145/375663.375670},
year = {2001}
}Incoming Citations (Sorted by Pagerank)
Showing 36 of 86 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 37 | Improved Histograms for Selectivity Estimation of Range Predicates | 1996 | SIGMOD | 0.00047731453 |
| 242 | Fast Incremental Maintenance of Approximate Histograms | 1997 | VLDB | 0.00023363722 |
| 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 |
| 519 | Random Sampling for Histogram Construction: How much is enough? | 1998 | SIGMOD | 0.00016942879 |
| 785 | A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data | 1997 | VLDB | 0.00014005637 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 456 | Mergeable Summaries | 2012 | PODS |
| 2 | 9,570 | Determining Exact Quantiles with Randomized Summaries | 2024 | SIGMOD |
| 3 | 2,750 | Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams | 2006 | PODS |
| 4 | 7,239 | Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald | 2024 | PODS |
| 5 | 252 | Approximate Medians and other Quantiles in One Pass and with Limited Memory | 1998 | SIGMOD |
| 6 | 710 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS |
| 7 | 4,564 | Relative Error Streaming Quantiles | 2021 | PODS |
| 8 | 450 | Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Datasets | 1999 | SIGMOD |
| 9 | 8,104 | Logging Every Footstep: Quantile Summaries for the Entire History | 2010 | SIGMOD |
| 10 | 5,320 | A Tight Lower Bound for Comparison-Based Quantile Summaries | 2020 | PODS |