Selectivity and cost estimation for joins based on random sampling

Journal of Computer and System Sciences

Volumn 52, Issue 3, 1996, Pages 550-569

  Haas, Peter J ^a   Naughton, Jeffrey F ^b   Seshadri, S ^c   Swami, Arun N ^d  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b University of Wisconsin Madison   (United States)

^c INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^d HEWLETT PACKARD ENTERPRISE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ESTIMATION; OPTIMIZATION; QUERY LANGUAGES; RANDOM PROCESSES; SAMPLING; STATISTICAL METHODS; THEOREM PROVING;

COST ESTIMATION; FIXED STEP PROCEDURES; JOIN QUERIES; PARTIAL ORDERING; RANDOM SAMPLING; SELECTIVITY ESTIMATION;

RELATIONAL DATABASE SYSTEMS;

EID: 0030169435     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0041     Document Type: Article

References (34)

1. F. J. Anscombe, Large-sample theory of sequential estimation, Proc. Cambridge Philos. Soc. 48 (1952), 600-607.
2. P. Billingsley, Probability and Measure, 2nd ed., Wiley, New York, 1986.
3. Y. S. Chow and H. Robbins, On the asymptotic theory of fixed-width confidence intervals for the mean, Ann. Math. Statist. 37 (1965), 457-462.
4. W. G. Cochran, Sampling Techniques, 3rd ed., Wiley, New York, 1977.
5. D. DeWitt, R. H. Katz, F. Olken, L. D. Shapiro, M. R. Stonebraker, and D. Wood, Implementation techniques for main memory database systems, in "Proceedings SIGMOD International Conference on Management of Data," pp. 1-8, Assoc. Comput. Mach., New York, 1984.
6. D. Dewitt, J. F. Naughton,D. A. Schneider, and S. Seshadri, Practical skew handling algorithms for parallel joins, in "Proceedings 19th Intl. Conf. Very Large Data Bases," pp. 27-40, Morgan Kaufmann, San Mateo, CA, 1992.
7. G. Graefe, Query evaluation techniques for large databases, ACM Comput. Surveys 25 (1993), 73-170.
8. A. Gut, Stopped Random Walks: Limit Theorems and Applications, Springer-Verlag, New York, 1988.
9. L. M. Haas, M. J. Carey, and M. Livny, "SEEKing the Truth about ad hoc Join Costs," Technical Report RJ 9101, IBM Almaden Research Center, San Jose, CA, 1993.
10. P. J. Haas, J. F. Naughton, S. Seshadri, and L. Stokes, Sampling-based estimation of the number of distinct values of an attribute, in "Proceedings, 21st Intl. Conf. Very Large Databases," pp. 311-322, Morgan Kaufmann, San Francisco, CA, 1995.
11. P. J. Haas, J. F. Naughton, S. Seshadri, and A. N. Swami, Fixed-precision estimation of join selectivity, in "Proceedings 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems," pp. 190-201, Assoc. Comput. Mach., New York, 1993.
12. P. J. Haas, J. F. Naughton, and A. N. Swami, On the relative cost of sampling for join selectivity estimation in "Proceedings, 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems," pp. 14-24, Assoc. Comput. Mach., New York, 1994.
13. P. J. Haas, and A. N. Swami, Sequential sampling procedures for query size estimation, in "Proceedings, SIGMOD International Conference on Management of Data," pp. 1-11, Assoc. Comput. Mach., New York, 1992.
14. P. J. Haas and A. N. Swami, "Sequential Procedures for Query Size Estimation," Technical Report RJ 9101, IBM Almaden Research Center, San Jose, CA, 1992 (the full version of Ref. [13]).
15. P. J. Haas, and A. N. Swami, Sampling-based selectivity estimation for joins using augmented frequent-value statistics, in "Proceedings 11th International Conference on Data Engineering," pp. 522-531, IEEE Comput. Soc., Los Alamitos, CA, 1995.
16. M. Hogan, "Moments of the Minimum of a Random Walk and Complete Convergence," Technical Report No. 21, Department of Statistics, Stanford University, 1983.
17. W. Hou, G. Ozsoyoglu, and B. Taneja, Statistical estimators for relational algebra expressions, in "Proceedings 7th ACM Symposium on Principles of Database Systems," pp. 276-287, Assoc. Comput. Mach., New York, 1988.
18. W. Hou, G. Ozsoyoglu, and B. Taneja, Processing aggregate relational queries with hard time constraints, in "Proceedings, ACM-SIGMOD International Conference on Management of Data," pp. 68-77, Assoc. Comput. Mach., New York, 1989.
19. W. Hou, G. Ozsoyoglu, and E. Dogdu, Error-constrained COUNT query evaluation in relational databases in "Proceedings ACM-SIGMOD International Conference on Management of Data," pp. 278-287, Assoc. Comput. Mach., New York, 1991.
20. Y. E. Ioannidis, and S. Christodoulakis, Optimal histograms for limiting worst-case error propagation in the size of join results, ACM Trans. Databases Systems 18 (1993), 709-748.
21. R. Krishnamurthy, H. Boral and C. Zaniolo, Optimization of non-recursive queries, in "Proceedings 12th Intl. Conf. Very Large Data Bases," pp. 128-137, Morgan Kaufmann, Palo Alto, CA, 1986.
22. R. J. Lipton and J. F. Naughton, Estimating the size of general transitive closures, in "Proceedings, 15th Intl. Conf. Very Large Data Bases," pp. 165-172, Morgan Kaufmann, Palo Alto, CA, 1989.
23. R. J. Lipton, and J. F. Naughton, Query size estimation by adaptive sampling, in "Proceedings, 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems," pp. 40-46, Assoc. Comput. Mach., New York, 1990.
24. R. J. Lipton, J. F. Naughton, and D. A. Schneider, Practical selectivity estimation through adaptive sampling, in "Proceedings ACM-SIGMOD International Conference on Management of Data," pp. 1-11, Assoc. Comput. Mach., New York, 1990.
25. P. Mishra, and M. Eich, Join processing in relational databases, ACM Comput. Surveys 24 (1992), 63-113.
26. A. Nádas, An extension of a theorem of Chow and Robbins on sequential confidence intervals for the mean, Ann. Math. Statist. 40 (1969), 667-671.
27. F. Olken and D. Rotem, Simple random sampling from relational databases, in "Proceedings, 12th Intl. Conf. Very Large Data Bases, 1986," pp. 160-169.
28. P. G. Selinger, D. D. Astrahan, R. A. Chamberlain, R. A. Lorie, and T. G. Price, Access path selection in a relational database management system, in "Proceedings ACM-SIGMOD International Conference on Management of Data," pp. 23-34, Assoc. Comput. Mach., New York, 1979.
29. K. D. Seppi, J. W. Barnes, and C. N. Morris, A Bayesian approach to database query optimization, ORSA J. Comput. 5 (1993), 410-419.
30. S. Seshadri, "Probabilistic Methods in Query Processing," Ph.D. dissertation, Department of Computer Sciences. University of Wisconsin, Madison, 1992.
31. A. N. Swami, and B. R. Iyer, A polynomial time algorithm for optimizing join queries, in "Proceedings IEEE Data Engrg. Conf.," pp. 345-354, IEEE Comput. Soc., 1993.
32. A. N. Swami, and K. B. Schiefer, On the estimation of join result sizes in "Proceedings Intl. Conf. Extending Database Technology, Cambridge, England, 1994."
33. A. Van Gelder, Multiple join size estimation by virtual domains, in "Proceedings, 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems," pp. 180-189, Assoc. Comput. Mach., New York, 1993.
34. E. A. Youngs and E. M. Cramer, Some results relevant to the choice of sum and sum-of-products algorithms, Technometrics 13 (1971), 657-665.