Access path selection in a relational database management system

  • Authors:
  • P. Griffiths Selinger;M. M. Astrahan;D. D. Chamberlin;R. A. Lorie;T. G. Price

  • Affiliations:
  • IBM Research Division, San Jose, California;IBM Research Division, San Jose, California;IBM Research Division, San Jose, California;IBM Research Division, San Jose, California;IBM Research Division, San Jose, California

  • Venue:
  • SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
  • Year:
  • 1979

Quantified Score

Hi-index 0.10

Visualization

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.