The notions of consistency and predicate locks in a database system

  • Authors:
  • K. P. Eswaran;J. N. Gray;R. A. Lorie;I. L. Traiger

  • Affiliations:
  • IBM Research Lab, San Jose, CA;IBM Research Lab, San Jose, CA;IBM Research Lab, San Jose, CA;IBM Research Lab, San Jose, CA

  • Venue:
  • Communications of the ACM
  • Year:
  • 1976

Quantified Score

Hi-index 48.33

Visualization

Abstract

In database systems, users access shared data under the assumption that the data satisfies certain consistency constraints. This paper defines the concepts of transaction, consistency and schedule and shows that consistency requires that a transaction cannot request new locks after releasing a lock. Then it is argued that a transaction needs to lock a logical rather than a physical subset of the database. These subsets may be specified by predicates. An implementation of predicate locks which satisfies the consistency condition is suggested.