FAMILY OF LOCKING PROTOCOLS FOR DATABASE SYSTEMS THAT ARE MODELED BY DIRECTED GRAPHS.

Abraham Silberschatz, Zvi Kedem

Research output: Contribution to journalArticle

Abstract

This study is concerned with the problem of ensuring the integrity of database sytems that are accessed concurrently by a number of independent asynchronously running transactions. It is assumed that the database system is partitioned into small units that are referred to as the database entities. The relation between the entities is represented by a directed acyclic graph in which the vertices correspond to the database entities and the arcs correspond to certain access rights. The authors develop a family of non-two-phase locking protocols for such systems that will be shown to ensure serializability and deadlock-freedom. This family is sufficiently general to encompass all the previously developed non-two-phase locking protocols as well as a number of new protocols. One of these new protocols that seems to be particularly useful is also presented.

Original languageEnglish (US)
Pages (from-to)558-562
Number of pages5
JournalIEEE Transactions on Software Engineering
VolumeSE-8
Issue number6
StatePublished - Nov 1982

Fingerprint

Directed graphs

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Electrical and Electronic Engineering

Cite this

FAMILY OF LOCKING PROTOCOLS FOR DATABASE SYSTEMS THAT ARE MODELED BY DIRECTED GRAPHS. / Silberschatz, Abraham; Kedem, Zvi.

In: IEEE Transactions on Software Engineering, Vol. SE-8, No. 6, 11.1982, p. 558-562.

Research output: Contribution to journalArticle

@article{c81e1e7e5df94c3f89b6a14914df64ac,
title = "FAMILY OF LOCKING PROTOCOLS FOR DATABASE SYSTEMS THAT ARE MODELED BY DIRECTED GRAPHS.",
abstract = "This study is concerned with the problem of ensuring the integrity of database sytems that are accessed concurrently by a number of independent asynchronously running transactions. It is assumed that the database system is partitioned into small units that are referred to as the database entities. The relation between the entities is represented by a directed acyclic graph in which the vertices correspond to the database entities and the arcs correspond to certain access rights. The authors develop a family of non-two-phase locking protocols for such systems that will be shown to ensure serializability and deadlock-freedom. This family is sufficiently general to encompass all the previously developed non-two-phase locking protocols as well as a number of new protocols. One of these new protocols that seems to be particularly useful is also presented.",
author = "Abraham Silberschatz and Zvi Kedem",
year = "1982",
month = "11",
language = "English (US)",
volume = "SE-8",
pages = "558--562",
journal = "IEEE Transactions on Software Engineering",
issn = "0098-5589",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - FAMILY OF LOCKING PROTOCOLS FOR DATABASE SYSTEMS THAT ARE MODELED BY DIRECTED GRAPHS.

AU - Silberschatz, Abraham

AU - Kedem, Zvi

PY - 1982/11

Y1 - 1982/11

N2 - This study is concerned with the problem of ensuring the integrity of database sytems that are accessed concurrently by a number of independent asynchronously running transactions. It is assumed that the database system is partitioned into small units that are referred to as the database entities. The relation between the entities is represented by a directed acyclic graph in which the vertices correspond to the database entities and the arcs correspond to certain access rights. The authors develop a family of non-two-phase locking protocols for such systems that will be shown to ensure serializability and deadlock-freedom. This family is sufficiently general to encompass all the previously developed non-two-phase locking protocols as well as a number of new protocols. One of these new protocols that seems to be particularly useful is also presented.

AB - This study is concerned with the problem of ensuring the integrity of database sytems that are accessed concurrently by a number of independent asynchronously running transactions. It is assumed that the database system is partitioned into small units that are referred to as the database entities. The relation between the entities is represented by a directed acyclic graph in which the vertices correspond to the database entities and the arcs correspond to certain access rights. The authors develop a family of non-two-phase locking protocols for such systems that will be shown to ensure serializability and deadlock-freedom. This family is sufficiently general to encompass all the previously developed non-two-phase locking protocols as well as a number of new protocols. One of these new protocols that seems to be particularly useful is also presented.

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

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

M3 - Article

VL - SE-8

SP - 558

EP - 562

JO - IEEE Transactions on Software Engineering

JF - IEEE Transactions on Software Engineering

SN - 0098-5589

IS - 6

ER -