Database Paper Browser

Back to papers

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)

Paper ID
1940
Venue
PODS
Year
2024
Pagerank
4.5784634e-05
Overall Rank
8,130 | 43.45%
DOI
10.1145/3651610

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers