Author:
Ivkin Nikita,Liberty Edo,Lang Kevin,Karnin Zohar,Braverman Vladimir
Abstract
Approximating quantiles and distributions over streaming data has been studied for roughly two decades now. Recently, Karnin, Lang, and Liberty proposed the first asymptotically optimal algorithm for doing so. This manuscript complements their theoretical result by providing a practical variants of their algorithm with improved constants. For a given sketch size, our techniques provably reduce the upper bound on the sketch error by a factor of two. These improvements are verified experimentally. Our modified quantile sketch improves the latency as well by reducing the worst-case update time from O(1ε) down to O(log1ε).
Subject
Electrical and Electronic Engineering,Biochemistry,Instrumentation,Atomic and Molecular Physics, and Optics,Analytical Chemistry
Reference28 articles.
1. Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., and Price, T.G. (June, January 30). Access path selection in a relational database management system. Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, Boston, MA, USA.
2. Improved histograms for selectivity estimation of range predicates;Poosala;ACM Sigmod Rec.,1996
3. Li, Z., Li, M., Wang, J., and Cao, Z. (2011, January 10–15). Ubiquitous data collection for mobile users in wireless sensor networks. Proceedings of the INFOCOM, 2011 Proceedings IEEE, Shanghai, China.
4. Interpreting the data: Parallel analysis with Sawzall;Pike;Sci. Program.,2005
5. DeWitt, D.J., Naughton, J.F., and Schneider, D.A. (1991, January 4–6). Parallel sorting on a shared-nothing architecture using probabilistic splitting. Proceedings of the Parallel and Distributed Information Systems, First International Conference on IEEE, Miami Beach, FL, USA.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献