An abstract model of database concurrency control algorithms

  • Authors:
  • Michael J. Carey

  • Affiliations:
  • University of California Berkeley, CA

  • Venue:
  • SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

An abstract model of concurrency control algorithms is presented. The model facilitates implementation-independent descriptions of various algorithms, allowing them to be specified in terms of the information that they require, the conditions under which blocking or restarts are called for, and the manner in which requests are processed. The model also facilitates comparisons of the relative storage and CPU overheads of various algorithms based on their descriptions. Results are given for single-site versions of two-phase locking, basic timestamp ordering, and serial validation. Extensions which will allow comparisons of multiple version and distributed algorithms are discussed as well.