Locks with constrained sharing

Divyakant Agrawal, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
Editors Anon
Place of PublicationNew York, NY, United States
PublisherPubl by ACM
Pages85-93
Number of pages9
Edition2-4
Publication statusPublished - 1 Apr 1990
Externally publishedYes
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

Cite this

Agrawal, D., & El Abbadi, A. (1990). Locks with constrained sharing. In Anon (Ed.), Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2-4 ed., pp. 85-93). New York, NY, United States: Publ by ACM.

Locks with constrained sharing. / Agrawal, Divyakant; El Abbadi, Amr.

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ed. / Anon. 2-4. ed. New York, NY, United States : Publ by ACM, 1990. p. 85-93.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Agrawal, D & El Abbadi, A 1990, Locks with constrained sharing. in Anon (ed.), Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 2-4 edn, Publ by ACM, New York, NY, United States, pp. 85-93, Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Nashville, TN, USA, 2/4/90.
Agrawal D, El Abbadi A. Locks with constrained sharing. In Anon, editor, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 2-4 ed. New York, NY, United States: Publ by ACM. 1990. p. 85-93
Agrawal, Divyakant ; El Abbadi, Amr. / Locks with constrained sharing. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. editor / Anon. 2-4. ed. New York, NY, United States : Publ by ACM, 1990. pp. 85-93
@inproceedings{3f4a2a9958884675a3c2a1e97865e72a,
title = "Locks with constrained sharing",
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.",
author = "Divyakant Agrawal and {El Abbadi}, Amr",
year = "1990",
month = "4",
day = "1",
language = "English",
pages = "85--93",
editor = "Anon",
booktitle = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",
publisher = "Publ by ACM",
edition = "2-4",

}

TY - GEN

T1 - Locks with constrained sharing

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 1990/4/1

Y1 - 1990/4/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025406473&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025406473&partnerID=8YFLogxK

M3 - Conference contribution

SP - 85

EP - 93

BT - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

A2 - Anon, null

PB - Publ by ACM

CY - New York, NY, United States

ER -