Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Datasets

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 28, Issue 2, 1999, Pages 251-262

  Manku, Gurmeet Singh ^a   Rajagopalan, Sridhar ^a   Lindsay, Bruce G ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242698558     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/304181.304204     Document Type: Article

References (21)

1. K. Alsabti, S. Ranka, and V. Singh. A One-Pass Algorithm for Accurately Estimating Quantites for Disk-Resident Data. In Proc. 23rd VLDB Conference, Athens, Greece, 1997.
2. R. Agrawal and A. Swami. A One-Pass Space-Efficient Algorithm for Finding Quantiles. In Proc. 7th Intl. Conf. Management of Data (COMAD-95), Pune, India, 1995.
3. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time Bounds for Selection. In J. Comput. Syst. Sci., volume 7, pages 448-461, 1973.
4. S Chaudhuri, R Motwani, and V Narasayya. Random Sampling for Histogram Construction: How much is enough? In ACM SIGMOD 98, volume 28, pages 436-447, Seattle, WA, USA, June 1998.
5. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, New York, 1991.
6. DB2 MVS. .
7. D. DeWitt, J. Naughton, and D. Schneider. Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting. In Proc. Intl. Conf. on Parallel and Distributed Inf. Sys., pages 280-291, Miami Beach, 1991.
8. P G Gibbons and Y Matias. New Sampling-based Summary Statistics for Improving Approximate Query Answers. In ACM SIGMOD 98, volume 28, pages 331-342, Seattle, WA, USA, June 1998.
9. P. B. Gibbons and Y. Matias. Synoptic Data Structures for Massive Data Sets. In To appear in DIMACS Series in Discrete Math. and Thy. Comp. Sc., 1999.
10. P G Gibbons, Y Matias, and V Poosala. Fast Incremental Maintenance of Approximate Histograms. In Proc. 23rd Intl. Conf. on Very Large Data Bases, pages 466-475, August 1997.
11. J. M. Hellerstein. Online Processing Redux. Bulletin of the IEEE Computer Society, 1997.
12. W. Hoeffding. Probability Inequalities for Sums of Bounded Random Variables. American Statistical Association Jornal, pages 13-30, March 1963.
13. Informix. .
14. J. I. Munro and M. S. Paterson. Selection and Sorting with Limited Storage. Theoretical Computer Science, 12:315-323, 1980.
15. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Approximate Medians and other Quantiles in One Pass and with Limited Memory. In ACM SIGMOD 98, volume 28, pages 426-435, Seattle, WA, USA, June 1998.
16. M. R. Paterson. Progress in Selection. Deptt. of Computer Science, University of Warwick, Coventry, UK, 1997.
17. V. Poosala, Y. E. Ioannidis, P. J. Haas, and E. J. Shekita. Improved Histograms for Selectivity Estimation of Range Predicates. In ACM SIGMOD 96, pages 294-305, Montreal, June 1996.
18. I. Pohl. A Minimum Storage Algorithm for Computing the Median. Technical Report IBM Research Report RC 2701 (# 12713), IBM T J Watson Center, November 1969.
19. P. G. Selinger, M. M. Astrahan, R. A. Lories, and T. G. Price. Access Path Selection in a Relational Database Management System. In ACM SIGMOD 79, June 1979.
20. J S Vitter. Random Sampling with a Reservoir. ACM Tran. Math. Software, 11(1):37-57, 1985.
21. F. F. Yao. On Lower Bounds for Selection Problems. Technical Report MAC TR-121, Massachusetts Institute of Technology, 1974.