Optimal Quantile Approximation in Streams

This paper resolves one of the longest standing basic problems in the streaming computational model. Namely, optimal construction of quantile sketches. An ε approximate quantile sketch receives a stream of items x1, ⋯, xn and allows one to approximate the rank of any query item up to additive error ε n with probability at least 1-δ. The rank of a query x is the number of stream items such that x i ≤ x. The minimal sketch size required for this task is trivially at least 1/ε. Felber and Ostrovsky obtain a O((1/ε)log(1/ε)) space sketch for a fixed δ. Without restrictions on the nature of the stream or the ratio between ε and n, no better upper or lower bounds were known to date. This paper obtains an O((1/ε)log log (1/δ)) space sketch and a matching lower bound. This resolves the open problem and proves a qualitative gap between randomized and deterministic quantile sketching for which an Ω((1/ε)log(1/ε)) lower bound is known. One of our contributions is a novel representation and modification of the widely used merge-and-reduce construction. This modification allows for an analysis which is both tight and extremely simple. The same technique was reported, in private communications, to be useful for improving other sketching objectives and geometric coreset constructions.

Authors

• Zohar Shay Karnin
• Kevin J. Lang
• Edo Liberty

Keywords

• Complexity theory
• Approximation algorithms
• Compaction
• Partitioning algorithms
• Additives
• Data structures
• Computer science
• Quantile Approximation
• Lower Bound
• Space Complexity
• Probability Of Failure
• Merging Algorithm
• Merge Operation
• quantiles
• streaming quantiles
• streaming median