Locks with constrained sharing

Divyakant Agrawal, Amr El Abbadi

Research output: Contribution to conferencePaper

27 Citations (Scopus)

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.

Original languageEnglish
Pages85-93
Number of pages9
Publication statusPublished - 1 Apr 1990
EventProceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - Nashville, TN, USA
Duration: 2 Apr 19904 Apr 1990

Other

OtherProceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
CityNashville, TN, USA
Period2/4/904/4/90

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture

Cite this

Agrawal, D., & El Abbadi, A. (1990). Locks with constrained sharing. 85-93. Paper presented at Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Nashville, TN, USA, .