Optimization of query evaluation algorithms

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]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[2]  E. F. Codd,et al.  A data base sublanguage founded on the relational calculus , 1971, SIGFIDET '71.

[3]  Leo R. Gotlieb.  Computing joins of relations , 1975, SIGMOD '75.

[4]  James B. Rothnie.  Evaluating inter-entry retrieval expressions in a relational data base management system , 1975, AFIPS '75.

[5]  Robert M. Pecherer,et al.  Efficient Evaluation of Expressions in a Relational Algebra , 1975, ACM Pacific.

[6]  Dennis Tsichritzis,et al.  A Network Framework for Relation Implementation , 1975, IFIP TC-2 Special Working Conference on Data Base Description.

[7]  Donald D. Chamberlin,et al.  Implementation of a structured English query language , 1975, CACM.

[8]  Donald D. Chamberlin,et al.  Implementation of a structured English query language , 1975, SIGMOD '75.

[9]  John Miles Smith,et al.  Optimizing the performance of a relational algebra database interface , 1975, CACM.

[10]  Eugene Wong,et al.  Decomposition—a strategy for query processing , 1976, TODS.

[11]  Irving L. Traiger,et al.  System R: A Relational Approach to Data Base Management , 1976, Berkeley Workshop.

[12]  Irving L. Traiger,et al.  System R: relational approach to database management , 1976, TODS.

[13]  Jane W.-S. Liu.  Algorithms for parsing search queries in systems with inverted file organization , 1976, TODS.

[14]  S. Bing Yao.  An attribute based model for database access cost analysis , 1977, TODS.

[15]  S. B. Yao,et al.  Approximating block accesses in database organizations , 1977, CACM.

[16]  Mario Schkolnick,et al.  A clustering algorithm for hierarchical structures , 1977, TODS.

[17]  Eugene Wong,et al.  Retrieving Dispersed Data from SDD-1: A System for Distributed Databases , 1986, Berkeley Workshop.

[18]  Vincent Y. Lum,et al.  EXPRESS: a data EXtraction, Processing, and Restructuring System , 1977, TODS.

[19]  M. W. Blasgen,et al.  Storage and Access in Relational Data Bases , 1977, IBM Syst. J..

[20]  Alan R. Hevner,et al.  Optimization of Data Access in Distributed Systems , 1978 .

[21]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[22]  S. B. Yao,et al.  Evaluation of database access paths , 1978, SIGMOD Conference.

[23]  Alan R. Hevner,et al.  Query Processing in Distributed Database System , 1979, IEEE Transactions on Software Engineering.