System R: Relational Approach to Database Management
Elsevier eBooksPublished 1 January 1989
M. M. Astrahan, Michael W. Blasgen, Donald D. Chamberlin, Kapali P. Eswaran, Jim Gray, Patricia P. Griffiths
Citations214
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
System R is a database management system which provides a high level relational data interface. The system provides a high level of data independence by isolating the end user as much as possible from underlying storage structures. The system permits definition of a variety of relational views on common underlying data. Data control features are provided, including authorization, integrity assertions, triggered transactions, a logging and recovery subsystem, and facilities for maintaining data consistency in a shared-update environment. This paper contains a description of the overall architecture and design of the system. At the present time the system is being implemented and the design evaluated. We emphasize that System R is a vehicle for research in database architecture, and is not planned as a product.
Keywords
Computer ScienceDecision Sciences
Communications of the ACMA relational model of data for large shared data banks
5,238 Citations1970E. F. Codd
A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.
Access path selection in a relational database management system
2,153 Citations1979Patricia G. Selinger, M. M. Astrahan +3 more
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.
Acta InformaticaOrganization and maintenance of large ordered indexes
1,345 Citations1972Raymond Bayer, Edward M. McCreight
The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logkI 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.
SEQUEL
576 Citations1976Donald D. Chamberlin, Raymond F. Boyce
The data manipulation facility for a structured English query language (SEQUEL) which can be used for accessing data in an integrated relational data base.
IBM Journal of Research and DevelopmentSEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
521 Citations1976Donald D. Chamberlin, M. M. Astrahan +6 more
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.
Query by example
489 Citations1975Moshé M. Zloof
In the last few years the authors have witnessed a trend to appeal to the non-professional user who has little or virtually no computer or mathematical background, and this book aims to address that need.
Communications of the ACMA history and evaluation of System R
273 Citations1981Donald D. Chamberlin, M. M. Astrahan +14 more
The three principal phases of the System R project are described and some of the lessons learned from System R about the design of relational systems and database systems in general are discussed.
Communications of the ACMOptimizing the performance of a relational algebra database interface
214 Citations1975John Miles Smith, Philip Yen-Tang Chang
An approach for implementing a “smart” interface to support a relational view of data is proposed to employ automatic programming techniques so that the interface analyzes and efficiently refines the high level query specification supplied by the user.
Granularity of locks in a shared data base
202 Citations1975Jim Gray, Raymond A. Lorie +1 more
This paper proposes a locking protocol which associates locks with sets of resources and allows simultaneous locking at various granularities by different transactions based on the introduction of additional lock modes besides the conventional share mode and exclusive mode.
INGRES
192 Citations1975Gerald Held, Michael Stonebraker +1 more
INGRES (Interactive Graphics and Retrieval System) is a relational data base and graphics system which is being implemented on a PDP-11/40 based hardware configuration at Berkeley.
IEEE Transactions on Software EngineeringUse of Psychological Experimentation as an Aid to Development of a Query Language
187 Citations1977Phyllis Reisner
This paper describes a series of psychological experiments used to test a new data base query language, aiming to make psychological testing of a language part of the design and development process.
Communications of the ACMImplementation of a structured English query language
154 Citations1975M. M. Astrahan, Donald D. Chamberlin
The relational model of data, the XRM Relational Memory System, and the SEQUEL language, a relational data sublanguage intended for ad hoc interactive problem solving by non-computer specialists, are reviewed.
A data management extension architecture
93 Citations1987Bruce G. Lindsay, John McPherson +1 more
The data management extension architecture is described, which provides common services for coordination of storage method and attachment execution and some implementation issues and techniques.
ACM Transactions on Database SystemsSupport for repetitive transactions and ad hoc queries in System R
92 Citations1981Donald D. Chamberlin, M. M. Astrahan +9 more
The architecture of System R is described, some preliminary measurements of system performance in both the ad hoc query and the “canned program” environments are given, and much of the work of parsing, name binding, and access path selection from the path of a running program is removed.
IBM Systems JournalSystem R: An architectural overview
53 Citations1981Michael W. Blasgen, M. M. Astrahan +15 more
Implementation of integrity constraints and views by query modification
47 Citations1975Michael Stonebraker
The MacAIMS data management system
46 Citations1970Robert C. Goldstein, Alois J. Strnad
The MacAIMS Data Management System (MADAM) is based on a relational model of data, and employs set-theoretic primitive operations for manipulating data.
A multi-level relational system
28 Citations1975John Mylopoulos, S. A. Schuster +1 more
A relational data base is composed of a set of time varying relations inter-related through common domains.
An authorization mechanism for a relational data base system
26 Citations1976Patricia P. Griffiths, Bradford W. Wade
Because revocation may be performed dynamically, a user's authorization for a table must be checked dynamically and a scheme which attempts to minimize the cost of such revalidation is presented.
A multi-level architecture for relational data base systems
21 Citations1975Hans Albrecht Schmid, Philip A. Bernstein
A multi-level architecture for relational data base systems that distinguishes clearly between user oriented features, access path structures, data structures and file organization, and allows efficiency problems to be isolated within levels and solved independently of each other, without impacting the logical structure of the user's virtual machine.
PRTV, an efficient implementation for large relational data bases
14 Citations1975Stephen Todd
PRTV is a research prototype interactive data base intended for use on its own or as part of a specialist system to provide high level flexible data support, functional extensibility and reasonable efficiency.
Information SystemsA Relational Data Management System
7 Citations1974V. Kevin Moore Whitney
RDMS is a flexible data analysis and manipulation system based on Codd's relational operations and Child’s set-theoretic operations and its implementation on a large virtual memory computer is given.
An experimental VM/370 based information system
7 Citations1975John Donovan, R. Fessel +2 more
The need to build a facility to respond to a requirement for information systems for two classes of application areas: areas where the problem addressed and the underlying data structures keep changing (e.g. energy policy making applications).