Locks with constrained sharing (extended abstract)

  • Authors:
  • Divyakant Agrawal;Amr El Abbadi

  • Affiliations:
  • Department of Computer Science University of California Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA

  • Venue:
  • PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new mode for locks that permits sharing in a constrained manner. We develop a family of locking protocols, the strictest of which is the two phase locking protocol while the most permissive recognizes all conflict-preserving serializable histories. This is the first locking-based protocol that can recognize the entire class of conflict-preserving serializable histories.