Share This Author
Access path selection in a relational database management system
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.
The notions of consistency and predicate locks in a database system
It is argued that a transaction needs to lock a logical rather than a physical subset of the database, and an implementation of predicate locks which satisfies the consistency condition is suggested.
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.
Granularity of Locks and Degrees of Consistency in a Shared Data Base
- J. Gray, R. Lorie, G. R. Putzolu, I. Traiger
- Computer ScienceIFIP Working Conference on Modelling in Data Base…
- 1 July 1998
A locking protocol which allows simultaneous locking at various granularities by different transactions is presented, based on the introduction of additional lock modes besides the conventional share mode an5 exclusive mode.
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…
The Recovery Manager of the System R Database Manager
The recovery subsystem of an experimental data management system is described and evaluated and the DO-UNDO-REDO protocol allows new recoverable types and operations to be added to the recovery system.
Granularity of locks in a shared data base
This paper proposes a locking protocol which associates locks with sets of resources. This protocol allows simultaneous locking at various granularities by different transactions. It is based on the…
Efficient and flexible methods for transient versioning of records to avoid locking by read-only transactions
We present efficient and flexible methods which permit read-only transactions that do not mind reading a possibly slightly old, but still consistent, version of the data base to execute without…
Version Support for Engineering Database Systems
The problem of rerouting interobject references on the creation of new versions is solved by providing generic references and user-specific environments and Logical version clusters are introduced that allow for the meaningful grouping of versions.
Long term preservation of digital information
- R. Lorie
- Computer ScienceJCDL '01
A novel approach to the preservation of digital data for the long term is presented, which distinguishes between archiving of data files andarchiving of programs (so that their behavior may be reenacted in the future).