S. Bing Yao
Abstract
A model of database storage and access is presented. The model represents many evaluation algorithms as special cases, and helps to break a complex algorithm into simple access operations. Generalized access cost equations associated with the model are developed and analyzed. Optimization of these cost equations yields an optimal access algorithm which can be synthesized by a query subsystem whose design is based on the modular access operations.
- 1 ASTRAHAN, M.M., AND CHAMBERLIN, D.D. Implementation of a structured English query language. Comm. ACM 18, 10 (Oct. 1975), 580-588. Google Scholar
Digital Library
- 2 ASTRAHAN, M.M., ET AL. System R: A relational approach to database management. ACM Trans. Database Syst. I, 2 (June 1976), 97-137. Google ScholarDigital Library
- 3 BLASGEN, M.W., AND ESWARAN, K.P. Storage access in relational data bases. IBM Syst. J. 4 (1977), 363-377.Google ScholarDigital Library
- 4 CODD, E.F. A relational model of data for large shared data banks. Comm. ACM 13, 6 (June 1970), 377-387. Google ScholarDigital Library
- 5 CODD, E.F. A data base sublanguage founded on the relational calculus. Proc. ACM SIGFIDET Workshop on Data Descripion, Access and Control, San Diego, Calif., 1971, pp. 35-68.Google ScholarDigital Library
- 6 GOTLEIB, L. Computing joins of relations. Proc. ACM-SIGMOD Conf. Manage. of Data, San Jose, Calif., May 1975, pp. 55-63. Google ScholarDigital Library
- 7 HEVNER, A.R., AND YAO, S.B. Query processing on distributed database systems. To appear in IEEE Trans. Software Eng. Google ScholarDigital Library
- 8 HEVNER, A.R., AND YAO, S.B. Optimization of data access in distributed systems. Tech. Rep. TR281, Comptr. Sci. Dept., Purdue U., W. Lafayette, Ind., July 1978.Google Scholar
- 9 IBM. Information Management System. General Information Manual, Form GH20-0765, IBM Corp., Data Processing Div., White Plains, N.Y.Google Scholar
- 10 KNUTH, D. The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison- Wesley, Reading, Mass., 1973. Google ScholarDigital Library
- 11 LIu, J.W.S. Algorithms for parsing search queries in systems with inverted f'de organizations. ACM Trans. Database Syst. 1, 4 (Dec~ 1976), 299-316. Google ScholarDigital Library
- 12 PECHERER, R.M. Efficient evaluation of expressions in a relational algebra. Proc. ACM Pacific 75 Conf., April 1975, pp. 44-49.Google Scholar
- 13 ROTHNIE, J.B. Evaluating inter-entry retrieval expressions in a relational database management system. Proc. AFIPS 1975 NCC, Vol. 44, AFIPS Press, Montvale, N.J., pp. 417-423.Google Scholar
- 14 SCHKOLNICK, M. A clustering algorithm for hierarchical structures. ACM Trans. Database Syst., 2, 1 (March 1977), 27-44. Google ScholarDigital Library
- 15 SHU, N.C., HOUSEL, B.C., TAYLOR, R.W., GHOSH, S.P., AND LUM, V.Y. EXPRESS: A data EXtraction, Processing and REStructuring System. A CM Trans. Database Syst. 2, 2 (June 1977), 134-174. Google ScholarDigital Library
- 16 SMITH, J.M., AND CHANG, P.Y.T. Optimizing the performance of a relational algebra database interface. Comm. ACM 18, 10 (Oct. 1975), 568-579. Google ScholarDigital Library
- 17 TSICHRITZIS, D. A network framework for relation implementation. IFIPS TC-2 Working Conf. Data Definition Languages, Jan. 1975.Google Scholar
- 18 Wo~G, E., AND YOUSSEFI, K. Decomposition--a strategy for query processing. ACM Tra~zs. Database Syst. 1, 3 (Sept. 1976), 223-241. Google ScholarDigital Library
- 19 YAO, S.B. An attribute based model for database access cost analysis. ACM Trans. Database Syst. 2, 1 (March 1977), 45-67. Google ScholarDigital Library
- 20 YAO, S.B., AND DEJoNc, D. Evaluation of database access paths. Proc. ACM SIGMOD Int. Conf. Manage. of Data, Austin, Tex., May 1978, pp. 66-77. Google ScholarDigital Library
- 21 YAo, S.B. Optimization of query evaluation algorithms. Tech. Rep. TR283, Comptr. Sci. Dept., Purdue U., W. Lafayette, Ind., Aug. 1978.Google Scholar
- 22 WONG, E. Retrieving dispersed data from SDD-I: A system for distributed databases. 1977 Berkeley Workshop on Distributed Data Manage. and Comptr. Networks, May 1977, pp. 217-235.Google Scholar
Index Terms
- Optimization of query evaluation algorithms
Recommendations
Optimizing the performance of a relational algebra database interface
An approach for implementing a “smart” interface to support a relational view of data is proposed. The basic idea is to employ automatic programming techniques so that the interface analyzes and efficiently refines the high level query specification ...
Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems
The problem of optimal query processing in distributed database systems was shown to be NP-hard. This means that heuristic algorithms are necessary to solve the query processing problem. In this paper, we describe algorithms to improve the solutions ...
Multidatabase Query Optimization
A multidatabase system (MDBS) allows the users to simultaneously access heterogeneous, and autonomous databases using an integrated schema and a single global query language. The query optimization problem in MDBSs is quite different from the query ...
Comments