论文信息 - Access Path Selection in a Relational Database Management System

Access Path Selection in a Relational Database Management System

In a high level query and data manipulation language such as SQL, requests are stated non-procedurally, without reference to access paths. This paper describes how System R chooses access paths for both simple (single relation) and complex queries (such as joins), given a user specification of desired data as a boolean expression of predicates. System R is an experimental database management system developed to carry out research on the relational model of data. System R was designed and built by members of the IBM San Jose Research Laboratory.

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

[2] Michael Stonebraker,et al. The design and implementation of INGRES , 1976, TODS.

[3] Randall L. Frank,et al. CODASYL Data-Base Management Systems , 1976, CSUR.

[4] Jørgen Fischer Nilsson,et al. An Access Specification Language for a Relational Data Base System , 1979, IBM J. Res. Dev..

[5] Stephen Todd. PRTV, an efficient implementation for large relational data bases , 1975, VLDB '75.

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

[7] Irving L. Traiger,et al. System R: A Relational Data Base Management System , 1975, Computer.

[8] Donald D. Chamberlin,et al. SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control , 1976, IBM J. Res. Dev..

[9] C. J. Date. An Introduction to Database Systems , 1975 .

[10] R. Bayer,et al. Organization and maintenance of large ordered indices , 1970, SIGFIDET '70.

[11] Irving L. Traiger,et al. Views, authorization, and locking in a relational data base system , 1975, AFIPS '75.