ACM Home Page
Please provide us with feedback. Feedback
Access path selection in a relational database management system
Full text PdfPdf (1.31 MB)
Source International Conference on Management of Data archive
Proceedings of the 1979 ACM SIGMOD international conference on Management of data table of contents
Boston, Massachusetts
SESSION: Database system implementation table of contents
Pages: 23 - 34  
Year of Publication: 1979
ISBN:0-89791-001-X
Authors
P. Griffiths Selinger  IBM Research Division, San Jose, California
M. M. Astrahan  IBM Research Division, San Jose, California
D. D. Chamberlin  IBM Research Division, San Jose, California
R. A. Lorie  IBM Research Division, San Jose, California
T. G. Price  IBM Research Division, San Jose, California
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 101,   Downloads (12 Months): 644,   Citation Count: 507
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/582095.582099
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Astrahan, M. M. et al. System R: A Relational Database Management System. To appear in Computer.
 
3
Bayer, R. and McCreight, E. Organization and Maintenance of Large Ordered Indices. Acta Informatica, Vol. 1, 1972.
 
4
Blasgen, M.W. and Eswaran, K.P. On the Evaluation of Queries in a Relational Data Base System. IBM Research Report RJ1745, April, 1976.
 
5
Chamberlin, D.D., et al. SEQUEL2: A Unified Approach to Data Definition, Manipulation, and Control. IBM Journal of Research and Development, Vol. 20, No. 6, Nov. 1976, pp. 560--575.
 
6
Chamberlin, D.D., Gray, J.N., and Traiger, I.L. Views, Authorization and Locking in a Relational Data Base System. ACM National Computer Conference Proceedings, 1975, pp. 425--430.
7
 
8
 
9
Lorie, R.A. and Wade, B.W. The Compilation of a Very High Level Data Language. IBM Research Report RJ2008, May, 1977.
 
10
Lorie, R.A. and Nilsson, J.F. An Access Specification Language for a Relational Data Base System. IBM Research Report RJ2218, April, 1978.
11
 
12
Todd, S. PRTV: An Efficient Implementation for Large Relational Data Bases. Proc. International Conf. on Very Large Data Bases, Framingham, Mass., September, 1975.
13
 
14
Zloof, M.M. Query by Example. Proc, AFIPS 1975 NCC, Vol. 44, AFIPS Press, Montvale, N.J., pp. 431--437.

CITED BY  507
Collaborative Colleagues:
P. Griffiths Selinger: colleagues
M. M. Astrahan: colleagues
D. D. Chamberlin: colleagues
R. A. Lorie: colleagues
T. G. Price: colleagues