A characterization of database graphs admitting a simple locking protocol

Zvi Kedem, Abraham Silberschatz

Research output: Contribution to journalArticle

Abstract

A simple locking protocol is presented for transactions executing concurrently in a database. The locking protocol is not two-phase, but each entity in the database may be locked at most once by any transaction. The database is modeled by a directed graph whose vertices correspond to the entities, and whose arcs correspond to certain locking restrictions. Necessary and sufficient conditions which assure serializability and deadlock-freedom in the absence of a concurrency control are derived.

Original languageEnglish (US)
Pages (from-to)1-13
Number of pages13
JournalActa Informatica
Volume16
Issue number1
DOIs
StatePublished - Aug 1981

Fingerprint

Network protocols
Concurrency control
Directed graphs

ASJC Scopus subject areas

  • Information Systems

Cite this

A characterization of database graphs admitting a simple locking protocol. / Kedem, Zvi; Silberschatz, Abraham.

In: Acta Informatica, Vol. 16, No. 1, 08.1981, p. 1-13.

Research output: Contribution to journalArticle

Kedem, Zvi ; Silberschatz, Abraham. / A characterization of database graphs admitting a simple locking protocol. In: Acta Informatica. 1981 ; Vol. 16, No. 1. pp. 1-13.
@article{a5981f042fde4403916f75f69b7dac7b,
title = "A characterization of database graphs admitting a simple locking protocol",
abstract = "A simple locking protocol is presented for transactions executing concurrently in a database. The locking protocol is not two-phase, but each entity in the database may be locked at most once by any transaction. The database is modeled by a directed graph whose vertices correspond to the entities, and whose arcs correspond to certain locking restrictions. Necessary and sufficient conditions which assure serializability and deadlock-freedom in the absence of a concurrency control are derived.",
author = "Zvi Kedem and Abraham Silberschatz",
year = "1981",
month = "8",
doi = "10.1007/BF00289586",
language = "English (US)",
volume = "16",
pages = "1--13",
journal = "Acta Informatica",
issn = "0001-5903",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - A characterization of database graphs admitting a simple locking protocol

AU - Kedem, Zvi

AU - Silberschatz, Abraham

PY - 1981/8

Y1 - 1981/8

N2 - A simple locking protocol is presented for transactions executing concurrently in a database. The locking protocol is not two-phase, but each entity in the database may be locked at most once by any transaction. The database is modeled by a directed graph whose vertices correspond to the entities, and whose arcs correspond to certain locking restrictions. Necessary and sufficient conditions which assure serializability and deadlock-freedom in the absence of a concurrency control are derived.

AB - A simple locking protocol is presented for transactions executing concurrently in a database. The locking protocol is not two-phase, but each entity in the database may be locked at most once by any transaction. The database is modeled by a directed graph whose vertices correspond to the entities, and whose arcs correspond to certain locking restrictions. Necessary and sufficient conditions which assure serializability and deadlock-freedom in the absence of a concurrency control are derived.

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

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

U2 - 10.1007/BF00289586

DO - 10.1007/BF00289586

M3 - Article

AN - SCOPUS:0019683250

VL - 16

SP - 1

EP - 13

JO - Acta Informatica

JF - Acta Informatica

SN - 0001-5903

IS - 1

ER -