Altruistic locking

  • Authors:
  • Kenneth Salem;Héctor García-Molina;Jeannie Shands

  • Affiliations:
  • Univ. of Maryland, College Park;Stanford Univ., Stanford, CA;Univ. of Maryland, College Park

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

Long-lived transactions (LLTs) hold on to database resources for relatively long periods of time, significantly delaying the completion of shorter and more common transactions. To alleviate this problem we propose an extension to two-phase locking, called altruistic locking, whereby LLTs can release their locks early. Transactions that access this released data are said to run in the wake of the LLT and must follow special locking rules. Like two-phase locking, altruistic locking is easy to implement and guarantees serializability.