eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2015-08-13
775
785
10.4230/LIPIcs.APPROX-RANDOM.2015.775
article
A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words
Felber, David
Ostrovsky, Rafail
A quantile summary is a data structure that approximates to epsilon-relative error the order statistics of a much larger underlying dataset.
In this paper we develop a randomized online quantile summary for the cash register data input model and comparison data domain model that uses O((1/epsilon) log(1/epsilon)) words of memory. This improves upon the previous best upper bound of O((1/epsilon) (log(1/epsilon))^(3/2)) by Agarwal et al. (PODS 2012). Further, by a lower bound of Hung and Ting (FAW 2010) no deterministic summary for the comparison model can outperform our randomized summary in terms of space complexity. Lastly, our summary has the nice property that O((1/epsilon) log(1/epsilon)) words suffice to ensure that the success probability is 1 - exp(-poly(1/epsilon)).
https://drops.dagstuhl.de/storage/00lipics/lipics-vol040-approx-random2015/LIPIcs.APPROX-RANDOM.2015.775/LIPIcs.APPROX-RANDOM.2015.775.pdf
order statistics
data stream
streaming algorithm