Consistency, concurrency, and crash recovery

Authors:
Y. Edmund Lien;Peter J. Weinberger
Affiliations:
Bell Laboratories, Murray Hill, New Jersey;Bell Laboratories, Murray Hill, New Jersey
Venue:
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Year:
1978

Citing 1
Cited 5

The notions of consistency and predicate locks in a database system

Communications of the ACM

A Theory of Safe Locking Policies in Database Systems

Journal of the ACM (JACM)
Serializability by Locking

Journal of the ACM (JACM)
Fault tolerance in deductive knowledge bases

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Deadlock-freedom (and saftey) of transactions in a distributed database

PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Issues of correctness in database concurrency control by locking

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method for increasing concurrency in shared data bases. A data base is taken to be a collection of entities with structure, such as relations. Concurrency is increased in the sense that several readers and a single writer may access a set of entities. At the same time, either serializability or a slightly weaker form of consistency can be seen by all transactions. Each transaction is assumed to obtain all its resources when it starts. The method also allows for convenient recovery from crashes which do not affect the information on secondary storage.