Timestamp-based algorithms for concurrency control in distributed database systems

Philip A. Bernstein, Nathan Goodman

Very Large Data Bases · 1980 · 134 citations · 7 references

Concepts

TL;DR

The study introduces timestamp‑based synchronization techniques to achieve read‑write and write‑write concurrency control. The authors decompose concurrency control into read‑write and write‑write subproblems, propose timestamp‑based synchronization techniques, and show how to combine any read‑write and write‑write technique into a complete method. The framework yields 12 detailed concurrency control methods, which can be refined into more than 50 distinct algorithms.

Abstract

We decompose the problem of concurrency control into the sub-problems of read-write and write-write synchronization. We present a series of timestamp- based algorithms (called synchronization techniques) that achieve read-write and/or write-write synchronization. And we show how to combine any read-write technique with any write-write technique to yield a complete concurrency control algorithm (called a method). Using this framework we describe 12 concurrency control methods in detail. Each principal method can be modified by refinements described in the paper, leading to more than 50 distinct concurrency control algorithms.

References

7