A one-pass algorithm for accurately estimating quantités for disk-resident data

Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997

Volumn , Issue , 1997, Pages 346-355

  Alsabti, Khaled ^a   Ranka, Sanjay ^b   Singh, Vineet ^c  

^a SYRACUSE UNIVERSITY   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

^c HITACHI AMERICA LTD   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SET; DATA VALUES; LOWER AND UPPER BOUNDS; NOCV1; ONE-PASS; PARALLEL FORMULATION; PRACTICAL PROBLEMS; PRIORI KNOWLEDGE;

EID: 84994126378     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining Associations between Sets of Items in Massive Databases. Proc. of the ACM SIGMOD Int'l Conference on Management of Data, Washington D.C, pages 207-216, May 1993.
2. R. Agrawal, K. Lin, H. S. Sawhney, and K. Shim. Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases. Proc. of VLDB, Zurich, 1995.
3. K. Alsabti, S. Ranka, and V. Singh. A One-Pass Parallel Algorithm for Accurately Estimating Quantiles for Disk-Resident Data. http://www.cise.ufl.edu/~ ranka/, 1997.
4. R. Agrawal and A. Swami. A One-Pass Space-Efficient Algorithm for Finding Quantiles. Proc. of the 7th Int'l Conf. Management of Data (COMAD-95), Pune, India, 1995.
5. R. Agrawal and R. Srikant. Mining Quantitative Association Rules in Large Relational Tables. In Proc. of the ACM SIGMOD Conference on Management of Data, Montreal, Canada, June 1996.
6. M. Blum et al. Time Bounds for Selection. Journal of Computers and Systems, 7:4:448-461, 1972.
7. K. Batcher. Sorting Networks and their applications. In Proceedings of the AFIPS Spring Joint Computing Conference, Vol. 32, 1968.
8. W. G. Cochran. Sampling Techniques. John Wiley and Sons, New York, N.Y. 3rd edition, 1977.
9. D. J. DeWitt et al. Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting. 1st Int'l Conf. on Parallel and Distributed Information Systems, Miami Beach:280-291, 1991.
10. R. W. Floyd and R. I. Rivest. Expected Time Bounds for Selection. Communications of the ACM, 18(3):165-172, 1975.
11. A. P. Gurajada and J. Srivastava. Equidepth Partitioning of a Data Set based on Finding its Medians. Technical Report TR-90-24, Computer Science Dept., Univ. of Minnesota, 1990.
12. R. Jain and I. Chlamtac. The P2 Algorithm for Dynamic Calculation for Quantiles and Histograms Without Storing Observations. C ACM, Vol. 28, No. 10:10761085, Oct. 1985.
13. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms. The Benjamin/Cummings Publishing Company, Ine, 1994.
14. R. P. Kooi. The Optimization of Queries in Relational Databases. PhD Thesis, Case Western Reserver University, Sept. 1980.
15. X. Li, P. Lu, J. Schaeffer, J. Shillington, P. S. Wong, and H. Shi. On the versatility of parallel sorting by regular sampling. Parallel Computing, 19(10) -.543-550, October 1993.
16. M. Muralikrishna and D. J. Dewitt. Equi-Depth Histograms for Estimating Selectivity Factors for Multidimensional queries. Proc. of ACM SIGMOD, Chicago, Illinois:28-36, June 1988.
17. J. I. Munro and M. S. Paterson. Selection and Sorting with Limited Storage. Theoretical Computer Science, 12:315-323, 1980.
18. V. Poosala, Y. E. Ioannidis, P. J. Haas, and E. J. Shekita. Improved Histogram for Selectivity Estimation of Range Predicates. Proc. of the 1996 ACM SIGMOD, Montreal:294-305, June 1996.
19. G. Piatetsky-Shapiro. Accurate Estimation of the Number of Tuples Satisfying a Condition. ACM SIGMOD 84, Boston:256-276, June 1984.
20. B. W. Schmeiser and S. J. Deutsch. Quantile Estimation from Grouped Data: The Cell MidPoint. Communications in Statistics: Simulation and Computation, B6(3):221-234, 1977.
21. G.K. Zipf. Human Behavior and the Principle of Least Effort. Addison-Wesley, Reading, MA, 1949.