Constrained shared locks for increasing concurrency in databases

D. Agrawal, A. El Abbadi

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, we extend the traditional relationships between locks, i.e., shared and non-shared, to permit sharing in a constrained manner. The new relationship between locks enables us to develop a family of locking protocols, the least permissive of which is two phase locking while the most permissive accepts all order-preserving conflict serializable histories. The latter protocol also accepts all conflict serializable histories without reordering read and write operations. Instances of the family of protocols can cope with a variety of database recovery problems.

Original languageEnglish
Pages (from-to)53-63
Number of pages11
JournalJournal of Computer and System Sciences
Volume51
Issue number1
DOIs
Publication statusPublished - 1 Aug 1995
Externally publishedYes

Fingerprint

Concurrency
Recovery
Phase Locking
Reordering
Locking
Sharing
Relationships
History
Family
Conflict

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Applied Mathematics
  • Computer Networks and Communications

Cite this

Constrained shared locks for increasing concurrency in databases. / Agrawal, D.; El Abbadi, A.

In: Journal of Computer and System Sciences, Vol. 51, No. 1, 01.08.1995, p. 53-63.

Research output: Contribution to journalArticle

Agrawal, D. ; El Abbadi, A. / Constrained shared locks for increasing concurrency in databases. In: Journal of Computer and System Sciences. 1995 ; Vol. 51, No. 1. pp. 53-63.
@article{605b93f0a33a45149823dd9ad3f86e9b,
title = "Constrained shared locks for increasing concurrency in databases",
abstract = "In this paper, we extend the traditional relationships between locks, i.e., shared and non-shared, to permit sharing in a constrained manner. The new relationship between locks enables us to develop a family of locking protocols, the least permissive of which is two phase locking while the most permissive accepts all order-preserving conflict serializable histories. The latter protocol also accepts all conflict serializable histories without reordering read and write operations. Instances of the family of protocols can cope with a variety of database recovery problems.",
author = "D. Agrawal and {El Abbadi}, A.",
year = "1995",
month = "8",
day = "1",
doi = "10.1006/jcss.1995.1052",
language = "English",
volume = "51",
pages = "53--63",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Constrained shared locks for increasing concurrency in databases

AU - Agrawal, D.

AU - El Abbadi, A.

PY - 1995/8/1

Y1 - 1995/8/1

N2 - In this paper, we extend the traditional relationships between locks, i.e., shared and non-shared, to permit sharing in a constrained manner. The new relationship between locks enables us to develop a family of locking protocols, the least permissive of which is two phase locking while the most permissive accepts all order-preserving conflict serializable histories. The latter protocol also accepts all conflict serializable histories without reordering read and write operations. Instances of the family of protocols can cope with a variety of database recovery problems.

AB - In this paper, we extend the traditional relationships between locks, i.e., shared and non-shared, to permit sharing in a constrained manner. The new relationship between locks enables us to develop a family of locking protocols, the least permissive of which is two phase locking while the most permissive accepts all order-preserving conflict serializable histories. The latter protocol also accepts all conflict serializable histories without reordering read and write operations. Instances of the family of protocols can cope with a variety of database recovery problems.

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

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

U2 - 10.1006/jcss.1995.1052

DO - 10.1006/jcss.1995.1052

M3 - Article

VL - 51

SP - 53

EP - 63

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 1

ER -