Controlling concurrency using locking protocols

Zvi Kedem, Abraham Silberschatz

Research output: Contribution to journalConference article

Abstract

This paper is concerned with the problem of developing locking protocols for ensuring the consistency of database systems that are accessed concurrently by a number of independent transactions. It is assumed that the database is modelled by a directed acyclic graph whose vertices correspond to the database entities, and whose arcs correspond to certain locking restrictions. Several locking protocols are presented. The weak protocol is shown to ensure consistency and deadlock-freedom only for databases that are organized as trees. For the databases that are organized as directed acyclic graphs, the strong protocol is presented. Discussion of SHARED and EXCLUSIVE locks is also included.

Original languageEnglish (US)
Article number4568022
Pages (from-to)274-285
Number of pages12
JournalProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
DOIs
StatePublished - Jan 1 1979
Event20th Annual Symposium on Foundations of Computer Science, FOCS 1979 - San Juan, United States
Duration: Oct 29 1979Oct 31 1979

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Controlling concurrency using locking protocols. / Kedem, Zvi; Silberschatz, Abraham.

In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 01.01.1979, p. 274-285.

Research output: Contribution to journalConference article

@article{0bb73203f0d048d49b36d4799ebc83fa,
title = "Controlling concurrency using locking protocols",
abstract = "This paper is concerned with the problem of developing locking protocols for ensuring the consistency of database systems that are accessed concurrently by a number of independent transactions. It is assumed that the database is modelled by a directed acyclic graph whose vertices correspond to the database entities, and whose arcs correspond to certain locking restrictions. Several locking protocols are presented. The weak protocol is shown to ensure consistency and deadlock-freedom only for databases that are organized as trees. For the databases that are organized as directed acyclic graphs, the strong protocol is presented. Discussion of SHARED and EXCLUSIVE locks is also included.",
author = "Zvi Kedem and Abraham Silberschatz",
year = "1979",
month = "1",
day = "1",
doi = "10.1109/SFCS.1979.12",
language = "English (US)",
pages = "274--285",
journal = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
issn = "0272-5428",

}

TY - JOUR

T1 - Controlling concurrency using locking protocols

AU - Kedem, Zvi

AU - Silberschatz, Abraham

PY - 1979/1/1

Y1 - 1979/1/1

N2 - This paper is concerned with the problem of developing locking protocols for ensuring the consistency of database systems that are accessed concurrently by a number of independent transactions. It is assumed that the database is modelled by a directed acyclic graph whose vertices correspond to the database entities, and whose arcs correspond to certain locking restrictions. Several locking protocols are presented. The weak protocol is shown to ensure consistency and deadlock-freedom only for databases that are organized as trees. For the databases that are organized as directed acyclic graphs, the strong protocol is presented. Discussion of SHARED and EXCLUSIVE locks is also included.

AB - This paper is concerned with the problem of developing locking protocols for ensuring the consistency of database systems that are accessed concurrently by a number of independent transactions. It is assumed that the database is modelled by a directed acyclic graph whose vertices correspond to the database entities, and whose arcs correspond to certain locking restrictions. Several locking protocols are presented. The weak protocol is shown to ensure consistency and deadlock-freedom only for databases that are organized as trees. For the databases that are organized as directed acyclic graphs, the strong protocol is presented. Discussion of SHARED and EXCLUSIVE locks is also included.

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

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

U2 - 10.1109/SFCS.1979.12

DO - 10.1109/SFCS.1979.12

M3 - Conference article

SP - 274

EP - 285

JO - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

JF - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SN - 0272-5428

M1 - 4568022

ER -