A Tight Lower Bound for Comparison-Based Quantile Summaries
Summary: Tight deterministic lower bound for comparison-based ε-approx quantile summaries: Ω((1/ε)·log(εN)) space, matching Greenwald–Khanna. Rules out any comparison-only summary with space f(ε)·o(log N) and yields stronger lower bounds for biased (relative-error) quantiles. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Graham Cormode (University of Warwick)
- 2. Pavel Veselý (University of Warwick)
BibTeX Citation
@inproceedings{cormode_pods20,
address = {New York, NY, USA},
series = {{PODS} '20},
title = {{A Tight Lower Bound for Comparison-Based Quantile Summaries}},
url = {https://dl.acm.org/doi/10.1145/3375395.3387650},
doi = {10.1145/3375395.3387650},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Cormode, Graham and Veselý, Pavel},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,564 | Relative Error Streaming Quantiles | 2021 | PODS | 6.5317429e-05 |
| 7,239 | Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald | 2024 | PODS | 5.5782302e-05 |
| 8,170 | Together is Better: Heavy Hitters Quantile Estimation | 2023 | SIGMOD | 5.3844369e-05 |
| 9,570 | Determining Exact Quantiles with Randomized Summaries | 2024 | SIGMOD | 5.1571823e-05 |
| 9,798 | SplineSketch: Even More Accurate Quantiles with Error Guarantees | 2026 | SIGMOD | 5.1257999e-05 |
| 10,674 | Quantile Estimation with Duplicates | 2026 | SIGMOD | 4.9793485e-05 |
| 10,840 | CrocSort: Resource-Efficient, Skew-Resilient Parallel External Merge Sort | 2026 | VLDB | 4.9793485e-05 |
| 11,865 | Scaling Equi-Joins | 2022 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 83 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD | 0.00035978046 |
| 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 |
| 456 | Mergeable Summaries | 2012 | PODS | 0.0001791284 |
| 2,573 | Minimal MapReduce Algorithms | 2013 | SIGMOD | 8.2821647e-05 |
| 2,750 | Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams | 2006 | PODS | 8.0573403e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,917 | Optimal Tracking of Distributed Heavy Hitters and Quantiles | 2009 | PODS |
| 2 | 9,570 | Determining Exact Quantiles with Randomized Summaries | 2024 | SIGMOD |
| 3 | 252 | Approximate Medians and other Quantiles in One Pass and with Limited Memory | 1998 | SIGMOD |
| 4 | 8,104 | Logging Every Footstep: Quantile Summaries for the Entire History | 2010 | SIGMOD |
| 5 | 710 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS |
| 6 | 2,750 | Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams | 2006 | PODS |
| 7 | 456 | Mergeable Summaries | 2012 | PODS |
| 8 | 4,564 | Relative Error Streaming Quantiles | 2021 | PODS |
| 9 | 7,239 | Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald | 2024 | PODS |
| 10 | 83 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD |