Sequential sampling procedures for query size estimation

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn Part F129624, Issue , 1992, Pages 341-350

  Haas, Peter J ^a   Swami, Arun N ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS;

ASYMPTOTIC PROPERTIES; ASYMPTOTICALLY EFFICIENT; DATA CHARACTERISTICS; ESTIMATION PROCEDURES; SEQUENTIAL ESTIMATION; SEQUENTIAL SAMPLING; SMALL SAMPLE SIZE; STRATIFIED SAMPLING;

IMAGE SEGMENTATION;

EID: 85031753595     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/130283.130321     Document Type: Conference Paper

References (22)

1. Chow, Y. S. and Robbins, H. (1965). On the asymptotic theory of fixed-width confidence intervals for the mean. Ann. Math. Statist. 37, 457-462.
2. Glynn, P. W. (1982). Asymptotic theory for non-parametric confidence intervals. Technical Report 63. Department of Operations Research. Stanford University. Stanford, California.
3. Gut, A. (1988) Stopped Random Walks: Limit Theorems and Applications. Springer-Verlag. New York.
4. Haas, P. J. and Swami, A. N. (1992). Sequential procedures for query size estimation. Technical Report RJ 8558. IBM Almaden Research Center. San Jose, California. (The full version of this paper.)
5. Hou, W., Ozsoyoglu, G., and Taneja, B. (1988). Statistical estimators for relational algebra expressions. Proc. 7th ACM Symposium on Principles of Database Systems, 276-287. Association for Computing Machinery. New York.
6. Hou, W., Ozsoyoglu, G., and Taneja, B. (1989). Processing aggregate relational queries with hard time constraints. Proc. SIGMOD International Conference on Management of Data, 68-77. Association for Computing Machinery. New York.
7. Hou, W., Ozsoyoglu, G., and Dogdu, E. (1991). Error-constrained COUNT query evaluation in relational databases. Proc. SIGMOD International Conference on Management of Data, 278-287. Association for Computing Machinery. New York.
8. IBM Corporation (1990). Capacity Planning for DB2 Applications. IBM Manual GG24-3512.
9. Jarke, M. and Koch, J. (1984). Query optimization in database systems. ACM Computing Surveys 16, 111-152.
10. Knuth, D. E. (1973). The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley. Reading, Massachusetts.
11. Lavenberg, S. S. and Sauer, C. H. (1977). Sequential stopping rules for the regenerative method of simulation. IBM J. Res. Develop. 21, 545-558
12. Lipton, R. J. and Naughton, J. F. (1989). Estimating the size of general transitive closures. Proc. 15th Conf. Very Large Data Bases, 165-171. Morgan Kaufmann. Palo Alto, California.
13. Lipton, R. J. and Naughton, J. F. (1990). Query size estimation by adaptive sampling. Proc. 9th ACM Symposium on Principles of Database Systems, 40-46. Association for Computing Machinery. New York.
14. Lipton, R. J., Naughton, J. F., and Schneider, D. A. (1990). Practical selectivity estimation through adaptive sampling. Proc. SIGMOD International Conference on Management of Data, 1-11. Association for Computing Machinery. New York.
15. Mannino, M. V., Chu, P., and Sager, T. (1988). Statistical profile estimation in database systems. ACM Computing Surveys 20, 191-221.
16. Nadas, A. (1969). An extension of a theorem of Chow and Robbins on sequential confidence intervals for the mean. Ann. Math. Statist. 40, 667-671.
17. Olken, F. and Rotem, D. (1989). Random sampling from B+ trees. Proc. 15th Conf. Very Large Data Bases, 269-278. Morgan Kaufmann. Palo Alto, California.
18. Peiser, A. M. (1943). Asymptotic formulas for significance levels of certain distributions. Ann. Math. Statist. 14, 56-62.
19. Seppi, K. (1990). A Bayesian approach to selected database issues. Ph.D. Dissertation. Graduate Program in Operations Research. University of Texas. Austin, Texas.
20. Shedler, G. S. (1987). Regeneration and Networks of Queues. Springer-Verlag. New York.
21. Siegmund, D. (1985). Sequential Analysis: Tests and Confidence Intervals. Springer-Verlag. New York.
22. Wolf, J., Dias, D., and Yu, P. (1990). An effective algorithm for parallelizing sort merge joins in the presence of data skew. Proc. 2nd International Symposium on Databases in Parallel and Distributed Systems, 103-115.