A Randomized Online Quantile Summary in O((1/ε) log(1/ε)) Words
暂无分享,去创建一个
[1] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[2] J. Ian Munro,et al. Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[3] Bruce G. Lindsay,et al. Approximate medians and other quantiles in one pass and with limited memory , 1998, SIGMOD '98.
[4] Bruce G. Lindsay,et al. Random sampling techniques for space efficient online computation of order statistics of large datasets , 1999, SIGMOD '99.
[5] Sanjeev Khanna,et al. Space-efficient online computation of quantile summaries , 2001, SIGMOD '01.
[6] Divyakant Agrawal,et al. Medians and beyond: new aggregation techniques for sensor networks , 2004, SenSys '04.
[7] Lu Wang,et al. Quantiles over data streams: an experimental study , 2013, SIGMOD '13.
[8] P. Agarwal,et al. Mergeable summaries , 2013, TODS.
[9] Edo Liberty,et al. Optimal Quantile Approximation in Streams , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).