A One-Pass Space-Efficient Algorithm for Finding Quantiles
暂无分享,去创建一个
[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] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..
[4] David J. DeWitt,et al. Equi-depth multidimensional histograms , 1988, SIGMOD '88.
[5] David J. DeWitt,et al. Parallel sorting on a shared-nothing architecture using probabilistic splitting , 1991, [1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems.
[6] Gregory Piatetsky-Shapiro,et al. Accurate estimation of the number of tuples satisfying a condition , 1984, SIGMOD '84.
[7] Imrich Chlamtac,et al. The P 2 algorithm for dynamic calculation of quantiles and histograms without st , 1985 .
[8] B. Schmeiser,et al. Quantile estimation from grouped data: the cell midpoint , 1977 .
[9] Patricia G. Selinger,et al. Access path selection in a relational database management system , 1979, SIGMOD '79.
[10] Donald D. Chamberlin,et al. Access Path Selection in a Relational Database Management System , 1989 .
[11] J. Srivastava,et al. Equidepth partitioning of a data set based on finding its medians , 1991, [Proceedings] 1991 Symposium on Applied Computing.