On optimistic methods for concurrency control

  • Authors:
  • H. T. Kung;John T. Robinson

  • Affiliations:
  • Carnegie-Mellon Univ., Pittsburgh, PA;Carnegie-Mellon Univ., Pittsburgh, PA

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 1981

Quantified Score

Hi-index 0.02

Visualization

Abstract

Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic” in the sense that they rely mainly on transaction backup as a control mechanism, “hoping” that conflicts between transactions will not occur. Applications for which these methods should be more efficient than locking are discussed.