Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald
Summary: Deterministic simplification of the Greenwald–Khanna sketch stores at most (2+o(1)) ε^{-1} log(εn) elements, matching optimal space for additive ε-approximate quantiles. Simplified analysis enables practical data-structure implementation with per-element time O(log(1/ε)+log log(εn)); extends to weighted quantiles with improved bounds. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Elena Gribelyuk (Princeton University)
- 2. Pachara Sawettamalya (Princeton University)
- 3. Hongxun Wu (University of California Berkeley)
- 4. Huacheng Yu (Princeton University)
BibTeX Citation
@inproceedings{gribelyuk_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Simple \& Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald}},
url = {https://dl.acm.org/doi/10.1145/3651610},
doi = {10.1145/3651610},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gribelyuk, Elena and Sawettamalya, Pachara and Wu, Hongxun and Yu, Huacheng},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,618 | SplineSketch: Even More Accurate Quantiles with Error Guarantees | 2026 | SIGMOD | 5.2434488e-05 |
| 10,289 | Sketch-based Secure Query Processing for Streaming Data | 2026 | SIGMOD | 5.093636e-05 |
| 10,673 | Pandora: An Efficient and Rapid Solution for Persistence-Based Tasks in High-Speed Data Streams | 2025 | SIGMOD | 5.093636e-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 |
|---|---|---|---|---|
| 24 | Spark SQL: Relational Data Processing in Spark | 2015 | SIGMOD | 0.00054865648 |
| 82 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD | 0.00036378991 |
| 2,716 | Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams | 2006 | PODS | 8.2108958e-05 |
| 4,291 | A Framework for Adversarially Robust Streaming Algorithms | 2020 | PODS | 6.7786745e-05 |
| 4,472 | Relative Error Streaming Quantiles | 2021 | PODS | 6.6810874e-05 |
| 5,599 | A Tight Lower Bound for Comparison-Based Quantile Summaries | 2020 | PODS | 6.154479e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 691 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS |
| 2 | 8,005 | Together is Better: Heavy Hitters Quantile Estimation | 2023 | SIGMOD |
| 3 | 10,487 | Quantile Estimation with Duplicates | 2026 | SIGMOD |
| 4 | 2,716 | Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams | 2006 | PODS |
| 5 | 9,386 | Determining Exact Quantiles with Randomized Summaries | 2024 | SIGMOD |
| 6 | 9,618 | SplineSketch: Even More Accurate Quantiles with Error Guarantees | 2026 | SIGMOD |
| 7 | 82 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD |
| 8 | 5,184 | KLL± Approximate Quantile Sketches over Dynamic Datasets | 2021 | VLDB |
| 9 | 5,599 | A Tight Lower Bound for Comparison-Based Quantile Summaries | 2020 | PODS |
| 10 | 4,472 | Relative Error Streaming Quantiles | 2021 | PODS |