Browse Prior Art Database

Access Path Selection In A Relational Database Management System

IP.com Disclosure Number: IPCOM000067742D
Original Publication Date: 1979-Sep-01
Included in the Prior Art Database: 2005-Feb-20

Publishing Venue

IBM

Related People

Authors:
Astrahan, MM Chamberlin, DD Lorie, RA Price, TG Selinger, PG [+details]

Abstract

The System R optimizer chooses both join order and an access path for each table in a SQL (sequential query language)-type statement given to System R. Of the many possible choices, the optimizer chooses the one which minimizes "total access cost" for performing the entire statement. For each relation, the path selector chooses between a segment scan and clustered and non-clustered index scans.