An Instant and Accurate Size Estimation Method for Joins and Selections in a Retrieval-Intensive Environment

ACM SIGMOD Record

Volumn 22, Issue 2, 1993, Pages 79-88

  Sun, Wei ^a   Ling, Yibei ^a   Rishe, Naphtali ^a   Deng, Yi ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; DECISION TABLES; ESTIMATION; INFORMATION RETRIEVAL SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; OPTIMIZATION; PARAMETER ESTIMATION; QUERY LANGUAGES; REGRESSION ANALYSIS; RELATIONAL DATABASE SYSTEMS; QUERY PROCESSING; SEARCH ENGINES;

EXECUTION PLAN; INFORMATION SYSTEM; PARAMETRIC METHOD; QUERY EVALUATION; REGRESSION MODEL; RETRIEVAL INTENSIVE DATABASE; SAMPLING METHOD; SELECTIVITY THEORY; SIZE ESTIMATION METHOD; TABLE BASED METHOD;

DATABASE SYSTEMS; REGRESSION ANALYSIS;

CPU TIME; DATA DEPENDENCIES; DATA DISTRIBUTION; ESTIMATION METHODS; NOVEL STRATEGIES; REGRESSION MODELLING; RUNTIMES; SAMPLING METHOD; SIZE ESTIMATION; TIME OF PROCESSING;

EID: 0027621686     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/170036.170055     Document Type: Article

References (28)

1. Ahrens, J.H. and Dieter, U., “Extensions of Forsythe's Method for Random Sampling from the Normal Distribution”. Math. Compu., 27, 124 (Oct. 1973), pp. 927-937.
2. Christodoulakis, S. “Estimating Record Selectivities”, Inf. Syst. 8, 2 1983, pp. 105-115.
3. Christodoulakis, S. “Estimating Block Transfers and Join Sizes”. In Proceedings of the ACM SIGMOD Conference (May). ACM, New York, 1983, pp. 40-54.
4. Christodoulakis, S. “Implications of Certain Assumptions in Database Performance Evaluation”, ACM Trans. On Database System, Vol.9, No. 2, pp. 163-186, June, 1984.
5. Gerard P. Weeg, Georgia B. Reed, “Introduction to Numerical Analysis”, Blaisdell Publishing Company, 1966, pp. 63-72.
6. Haas, P. and Swami, A., “Sequential sampling procedures for query size estimation”, ACM SIGMOD, 1992, pp. 341-350.
7. Hou, Wen-chi, Ozsoyoglu, G., and Dogdu, E., “Error-Constrained Count Query Evaluation in Relational Databases”, Proc. ACM SIGMOD, 1991, pp. 279-287.
8. Hou, Wen-chi, Ozsoyoglu, G., B. Taneja, “Statistical Estimator for Relational Algebra Expression”, Proc. of ACM SIGMOD, Austin, TX, 1988, pp. 278-287.
9. Hou, Wen-chi, Ozsoyoglu, G., B. Taneja, “Processing Aggregate Relational Queries with Hard Time Constraints”, ACM SIGMOD, Portland, OR, 1989, pp. 165-172.
10. Hou, Wen-chi, Ozsoyoglu, G., “Statistical Estimators fot Aggregate Relational Algebra Queries”, Acm TODS, 16, 4 (December), 1991, pp. 600-654.
11. Jarke, M. and Koch, J., “Query optimization in database systems”, ACM Computing Surveys, Vol 16, 1984, pp. 111-152.
12. Marvin J. Karson, “Multivariate Statistical Methods”, The Iowa State University Press, 1982.
13. R. Kooi. “The optimization of queries in relational database systems”. PhD thesis, Case Western University, Cleveland, Ohio, 1980.
14. Lefons, E., Silvestri, A. and Tangorra, F., “An Analytic Approach to Statistical Databases”, Proc. of VLDB, Firenze 1983, pp. 260-274.
15. L'Ecuyer, P. and Cote, S. 1991. “Implementing a Random Number Package with Splitting Facilities.” ACM Trans, on Mathematical Software, pp. 98-111
16. Ling, Y. and Sun, W., “A Supplement to Sampling-Based Methods for Query Size Estimation in a Database System”, ACM SIGMOD RECORD, Dec. 1992, pp. 12-15.
17. Richard J. Lipton, Jeffrey F. Naughton, and Donovan A. Schneider, “Practical Selectivity Estimation through Adaptive Sampling”, In Proc. of ACM SIGMOD, 1990, pp. 1-12.
18. Luk, W. S. and Black, P. A., “On Cost Estimation in Processing a Query in a Distributed Database System”, Proc. of the IEEE 5th COMSAC, Chicago, IL, Nov. 1981, pp. 24-32.
19. C. Lynch, “Selectivity estimation and query optimization in large databases with highly skewed distributions of column values”. In proc. Fourteenth VLDB, August 1988, pp. 240-251.
20. M. J. Maron, “Numerical Analysis-A practical approach”, Macmillan Publishing Company, 1987.
21. Michael V. Mannino, et al., “Statistical Profile Estimation in Database System”, ACM Computing Surveys, Vol. 20, No 3, September, 1988, pp. 191-221.
22. M. Muralikrishna and D. DeWitt. “Statistical Profile estimation in database system”, Computing Surveys, 20(3) Sept. 1988, pp. 191-221.
23. Tommaso Mostardi, “Estimating The Size of Relational SPTJ Operation Results: An Analytic Approach”, Infor. Syst., Vol. 15, 1990, pp. 591-601.
24. Selinger, P., Astrahan, M., Chamberlin, D., Lorie, R., and Price, T., “Access Path Selection in a Relational Database Management System”, In Proc. of ACM SIGMOD, San Jose, CA, 1979, pp. 23-34.
25. Walton, C., “Four Types of Data Skew and Their Effect on Parallel Join Performance”, TR-90-12, Computer Science Dept., Univ. of Texas at Austin, 1990.
26. Wolf, J., Dias, D., Yu, P., and Turek, J., “A Parallel Hash-Join Algorithm for Managing Data Skew”, Tech Report RC 16489, IBM Watson Center, 1991.
27. Yao, S. 1977. “Approximating block accesses in database organizations”. Commun. ACM 20, 4 (Apr.), pp. 260-261.
28. Yu, C. and Chang, C., “Distributed Query Processing”, ACM Computing Survey, 1984, pp. 399 - 433.