Access path selection in a relational database management system

  title={Access path selection in a relational database management system},
  author={Patricia G. Selinger and Morton M. Astrahan and Donald D. Chamberlin and Raymond A. Lorie and Thomas G. Price},
  booktitle={SIGMOD '79},
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… 

Figures from this paper

Query processing strategies in the PASCAL/R relational database management system
The paper investigates transformation strategies used in the PASCAL/R system to evaluate queries with existential and universal quantifiers to offer new insight into recently proposed query optimization techniques and allows some of them to be extended.
Local and Global Query Optimization Mechanisms for Relational Databases
This paper has developed an optimization mechanisin, built it in a relational DBMS product at Hitachi, and proposes a global optimization mechanisn which executes optimization over multiple database queries.
A Framework for Query Optimization in Temporal Databases
This work investigates issues pertaining to query processing of temporal databases in a relational environment and defines four types of temporal joins— theta-join, time intersection, time union and the event-join.
Prolog-Based Meta-Rules For Relational Database Representation and Manipulation
A Prolog-based experimental system for relational databases that is not defined from the viewpoint of any specific relational topic is proposed and offers a well-defined environment for studying how other systems can be integrated with relational databases.
A User-Defined Index for Containment Queries in XML
An extensible index to support containment queries over the XML data stored as BLOB type in ORDBMSs is proposed and the main advantage of this index is user's productivity in handling XML data in SQL language.
Efficient evaluation of XML middle-ware queries
This work addresses the problem of efficiently constructing materialized XML views of relational databases by focusing on how to best choose the SQL queries, without having control over the target RDBMS.
A rule-based view of query optimization
This paper describes its operations by transformation rules which generate different QEPs from initial query specifications and hopes that the approach taken will contribute to the more general goal of a modular query optimizer as part of an extensible database management system.
Query evaluation techniques for large databases
This survey describes a wide array of practical query evaluation techniques for both relational and postrelational database systems, including iterative execution of complex query evaluation plans, the duality of sort- and hash-based set-matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.


An Access Specification Language for a Relational Data Base System
It is conjecture that the introducing of an access specification language provides a conceptual platform for the handling of the "optimization" problem and is implemented as a target language for the optimizer part of the complier.
System R: relational approach to database management
This paper contains a description of the overall architecture and design of the system, and emphasizes that System R is a vehicle for research in database architecture, and is not planned as a product.
Views, authorization, and locking in a relational data base system
The examples in this paper will be drawn from a data base which describes a department store and consists of three relations: EMP, SAL, MGR, DEPT, and LOC.
SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
SEQUEL 2 is a relational data language that provides a consistent, English keyword-oriented set of facilities for query, data definition, data manipulation, and datac ontrol. SEQUEL 2 may be used
System R: A Relational Data Base Management System
A relational approach makes this experimental data base management system unusually easy to install and use and offers major bonuses in other areas.
Decomposition—a strategy for query processing
Strategy for processing multivariable queries in the database management system INGRES is considered, and algorithms for reduction and for choosing the variable to be substituted are given.
An Introduction to Database Systems
Readers of this book will gain a strong working knowledge of the overall structure, concepts, and objectives of database systems and will become familiar with the theoretical principles underlying the construction of such systems.
The design and implementation of INGRES
The currently operational (March 1976) version of the INGRES database management system is described. This multiuser system gives a relational view of data, supports two high level nonprocedural data
CODASYL Data-Base Management Systems
This paper presents in tutorial fashion the concepts, notation, features, and examples of the data-base languages that were defined by the CODASYL Data Description Language and Programming Language Committees.
Organization and maintenance of large ordered indices
The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logk I where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal.