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
- 2. Pavel Veselý
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,966 | Relative Error Streaming Quantiles | 2021 | PODS | 5.7959749e-05 |
| 8,062 | Together is Better: Heavy Hitters Quantile Estimation | 2023 | SIGMOD | 4.5943269e-05 |
| 8,130 | Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald | 2024 | PODS | 4.5784634e-05 |
| 9,237 | Determining Exact Quantiles with Randomized Summaries | 2024 | SIGMOD | 4.3690661e-05 |
| 10,113 | SplineSketch: Even More Accurate Quantiles with Error Guarantees | 2026 | SIGMOD | 4.1945683e-05 |
| 10,198 | Quantile Estimation with Duplicates | 2026 | SIGMOD | 4.1945683e-05 |
| 11,358 | Scaling Equi-Joins | 2022 | SIGMOD | 4.1945683e-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 |
|---|---|---|---|---|
| 126 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD | 0.00044744986 |
| 275 | Approximate Medians and other Quantiles in One Pass and with Limited Memory | 1998 | SIGMOD | 0.00029364901 |
| 402 | Mergeable Summaries | 2012 | PODS | 0.00024196343 |
| 443 | Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Datasets | 1999 | SIGMOD | 0.00022996573 |
| 2,674 | Minimal MapReduce Algorithms | 2013 | SIGMOD | 8.3328645e-05 |
| 2,955 | Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams | 2006 | PODS | 7.8239173e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,249 | Optimal Tracking of Distributed Heavy Hitters and Quantiles | 2009 | PODS | 6.3245666e-05 |
| 9,237 | Determining Exact Quantiles with Randomized Summaries | 2024 | SIGMOD | 4.3690661e-05 |
| 275 | Approximate Medians and other Quantiles in One Pass and with Limited Memory | 1998 | SIGMOD | 0.00029364901 |
| 7,515 | Logging Every Footstep: Quantile Summaries for the Entire History | 2010 | SIGMOD | 4.7180617e-05 |
| 848 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS | 0.0001597308 |
| 2,955 | Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams | 2006 | PODS | 7.8239173e-05 |
| 402 | Mergeable Summaries | 2012 | PODS | 0.00024196343 |
| 4,966 | Relative Error Streaming Quantiles | 2021 | PODS | 5.7959749e-05 |
| 8,130 | Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald | 2024 | PODS | 4.5784634e-05 |
| 126 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD | 0.00044744986 |