CONTROLLING CONCURRENCY USING LOCKING PROTOCOLS.

Zvi Kedem, Abraham Silberschatz

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

The problem of developing locking protocols for ensuring the consistency of database systems that are accessed concurrently by a number of independent transactions is considered. It is assumed that the database is modeled 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)
Title of host publicationAnnual Symposium on Foundations of Computer Science - Proceedings
PublisherIEEE
Pages274-285
Number of pages12
StatePublished - 1979
EventAnnu Symp Found Comput Sci Proc 20th - San Juan Bautista, PR
Duration: Oct 29 1979Oct 31 1979

Other

OtherAnnu Symp Found Comput Sci Proc 20th
CitySan Juan Bautista, PR
Period10/29/7910/31/79

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Kedem, Z., & Silberschatz, A. (1979). CONTROLLING CONCURRENCY USING LOCKING PROTOCOLS. In Annual Symposium on Foundations of Computer Science - Proceedings (pp. 274-285). IEEE.

CONTROLLING CONCURRENCY USING LOCKING PROTOCOLS. / Kedem, Zvi; Silberschatz, Abraham.

Annual Symposium on Foundations of Computer Science - Proceedings. IEEE, 1979. p. 274-285.

Research output: Chapter in Book/Report/Conference proceedingChapter

Kedem, Z & Silberschatz, A 1979, CONTROLLING CONCURRENCY USING LOCKING PROTOCOLS. in Annual Symposium on Foundations of Computer Science - Proceedings. IEEE, pp. 274-285, Annu Symp Found Comput Sci Proc 20th, San Juan Bautista, PR, 10/29/79.
Kedem Z, Silberschatz A. CONTROLLING CONCURRENCY USING LOCKING PROTOCOLS. In Annual Symposium on Foundations of Computer Science - Proceedings. IEEE. 1979. p. 274-285
Kedem, Zvi ; Silberschatz, Abraham. / CONTROLLING CONCURRENCY USING LOCKING PROTOCOLS. Annual Symposium on Foundations of Computer Science - Proceedings. IEEE, 1979. pp. 274-285
@inbook{f79c9c43b91240afaf2ff211383f6cdf,
title = "CONTROLLING CONCURRENCY USING LOCKING PROTOCOLS.",
abstract = "The problem of developing locking protocols for ensuring the consistency of database systems that are accessed concurrently by a number of independent transactions is considered. It is assumed that the database is modeled 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",
language = "English (US)",
pages = "274--285",
booktitle = "Annual Symposium on Foundations of Computer Science - Proceedings",
publisher = "IEEE",

}

TY - CHAP

T1 - CONTROLLING CONCURRENCY USING LOCKING PROTOCOLS.

AU - Kedem, Zvi

AU - Silberschatz, Abraham

PY - 1979

Y1 - 1979

N2 - The problem of developing locking protocols for ensuring the consistency of database systems that are accessed concurrently by a number of independent transactions is considered. It is assumed that the database is modeled 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 - The problem of developing locking protocols for ensuring the consistency of database systems that are accessed concurrently by a number of independent transactions is considered. It is assumed that the database is modeled 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=0018683407&partnerID=8YFLogxK

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

M3 - Chapter

SP - 274

EP - 285

BT - Annual Symposium on Foundations of Computer Science - Proceedings

PB - IEEE

ER -