Ordered sharing

A new lock primitive for database systems

Divyakant Agrawal, Amr El Abbadi

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We propose a new lock primitive called ordered sharing that allows increased concurrency in database systems. A generalized two phase locking protocol is developed that may employ locks with the standard shared and non-shared relationships as well as the proposed ordered shared relationships between locks. The paper then addresses the reliability and performance issues of the proposed protocol. We show that ordered sharing results in a set of protocols that are optimal in both their reliability and concurrency aspects. A simulation study demonstrates that ordered sharing results in improved performance in database systems. The general applicability of the new primitive is further demonstrated by using it in several representative database environments.

Original languageEnglish
Pages (from-to)361-392
Number of pages32
JournalInformation Systems
Volume20
Issue number5
Publication statusPublished - 1 Jul 1995
Externally publishedYes

Fingerprint

Data base
Concurrency
Simulation study

Keywords

  • Concurrency Control
  • Database Recovery
  • Transaction Processing

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Management Information Systems
  • Management of Technology and Innovation

Cite this

Agrawal, D., & El Abbadi, A. (1995). Ordered sharing: A new lock primitive for database systems. Information Systems, 20(5), 361-392.

Ordered sharing : A new lock primitive for database systems. / Agrawal, Divyakant; El Abbadi, Amr.

In: Information Systems, Vol. 20, No. 5, 01.07.1995, p. 361-392.

Research output: Contribution to journalArticle

Agrawal, D & El Abbadi, A 1995, 'Ordered sharing: A new lock primitive for database systems', Information Systems, vol. 20, no. 5, pp. 361-392.
Agrawal D, El Abbadi A. Ordered sharing: A new lock primitive for database systems. Information Systems. 1995 Jul 1;20(5):361-392.
Agrawal, Divyakant ; El Abbadi, Amr. / Ordered sharing : A new lock primitive for database systems. In: Information Systems. 1995 ; Vol. 20, No. 5. pp. 361-392.
@article{4aa4dd1577e64587a11026f1d04744bd,
title = "Ordered sharing: A new lock primitive for database systems",
abstract = "We propose a new lock primitive called ordered sharing that allows increased concurrency in database systems. A generalized two phase locking protocol is developed that may employ locks with the standard shared and non-shared relationships as well as the proposed ordered shared relationships between locks. The paper then addresses the reliability and performance issues of the proposed protocol. We show that ordered sharing results in a set of protocols that are optimal in both their reliability and concurrency aspects. A simulation study demonstrates that ordered sharing results in improved performance in database systems. The general applicability of the new primitive is further demonstrated by using it in several representative database environments.",
keywords = "Concurrency Control, Database Recovery, Transaction Processing",
author = "Divyakant Agrawal and {El Abbadi}, Amr",
year = "1995",
month = "7",
day = "1",
language = "English",
volume = "20",
pages = "361--392",
journal = "Information Systems",
issn = "0306-4379",
publisher = "Elsevier Limited",
number = "5",

}

TY - JOUR

T1 - Ordered sharing

T2 - A new lock primitive for database systems

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 1995/7/1

Y1 - 1995/7/1

N2 - We propose a new lock primitive called ordered sharing that allows increased concurrency in database systems. A generalized two phase locking protocol is developed that may employ locks with the standard shared and non-shared relationships as well as the proposed ordered shared relationships between locks. The paper then addresses the reliability and performance issues of the proposed protocol. We show that ordered sharing results in a set of protocols that are optimal in both their reliability and concurrency aspects. A simulation study demonstrates that ordered sharing results in improved performance in database systems. The general applicability of the new primitive is further demonstrated by using it in several representative database environments.

AB - We propose a new lock primitive called ordered sharing that allows increased concurrency in database systems. A generalized two phase locking protocol is developed that may employ locks with the standard shared and non-shared relationships as well as the proposed ordered shared relationships between locks. The paper then addresses the reliability and performance issues of the proposed protocol. We show that ordered sharing results in a set of protocols that are optimal in both their reliability and concurrency aspects. A simulation study demonstrates that ordered sharing results in improved performance in database systems. The general applicability of the new primitive is further demonstrated by using it in several representative database environments.

KW - Concurrency Control

KW - Database Recovery

KW - Transaction Processing

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

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

M3 - Article

VL - 20

SP - 361

EP - 392

JO - Information Systems

JF - Information Systems

SN - 0306-4379

IS - 5

ER -