Space-efficient online computation of quantile summaries
暂无分享,去创建一个
[1] J. Ian Munro,et al. Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[2] Imrich Chlamtac,et al. The P2 algorithm for dynamic calculation of quantiles and histograms without storing observations , 1985, CACM.
[3] Rakesh Agrawal,et al. A One-Pass Space-Efficient Algorithm for Finding Quantiles , 1995, COMAD.
[4] Mike Paterson,et al. Progress in Selection , 1996, SWAT.
[5] Peter J. Haas,et al. Improved histograms for selectivity estimation of range predicates , 1996, SIGMOD '96.
[6] Michael B. Greenwald,et al. Practical Algorithms for Self Scaling Histograms or Better than Average Data Collection , 1996, Perform. Evaluation.
[7] Sanjay Ranka,et al. A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data , 1997, VLDB.
[8] Bruce G. Lindsay,et al. Approximate medians and other quantiles in one pass and with limited memory , 1998, SIGMOD '98.
[9] Rajeev Motwani,et al. Random sampling for histogram construction: how much is enough? , 1998, SIGMOD '98.
[10] Yannis E. Ioannidis,et al. Approximate Query Answering using Histograms , 1999, IEEE Data Eng. Bull..
[11] Bruce G. Lindsay,et al. Random sampling techniques for space efficient online computation of order statistics of large datasets , 1999, SIGMOD '99.
[12] Yossi Matias,et al. Fast incremental maintenance of approximate histograms , 1997, TODS.