Formal Aspects of Serializability in Database Concurrency Control

Authors:
P. A. Bernstein;D. W. Shipman;W. S. Wong
Affiliations:
Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138, and with the Computer Corporation of America;-;-
Venue:
IEEE Transactions on Software Engineering
Year:
1979

Citing 0
Cited 9

Performance models of timestamp-ordering concurrency control algorithms in distributed databases

IEEE Transactions on Computers
Errors in 'process synchronization in database systems'

ACM SIGMOD Record
A concurrency control algorithm in a distributed environment

AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Read invisibility, virtual world consistency and probabilistic permissiveness are compatible

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations)

Theoretical Computer Science
Proving the correctness of nonblocking data structures

Communications of the ACM
Proving the Correctness of Nonblocking Data Structures

Queue - Concurrency
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles

ACM SIGOPS 24th Symposium on Operating Systems Principles
Tango: distributed data structures over a shared log

Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles

Quantified Score

Hi-index	0.04

Visualization

Abstract

An arbitrary interleaved execution of transactions in a database system can lead to an inconsistent database state. A number of synchronization mechanisms have been proposed to prevent such spurious behavior. To gain insight into these mechanisms, we analyze them in a simple centralized system that permits one read operation and one write operation per transaction. We show why locking mechanisms lead to correct operation, we show that two proposed mechanisms for distributed environments are special cases of locking, and we present a new version of lockdng that alows more concurrency than past methods. We also examine conflict graph analysis, the method used in the SDD-1 distributed database system, we prove its correctness, and we show that it can be used to substantially improve the performance of almost any synchronization mechanisn.