A characterization of database graphs admitting a simple locking protocol

Zvi Kedem; Abraham Silberschatz

doi:10.1007/BF00289586

A characterization of database graphs admitting a simple locking protocol

Zvi Kedem, Abraham Silberschatz

Computer Science

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	1-13
Number of pages	13
Journal	Acta Informatica
Volume	16
Issue number	1
DOIs	https://doi.org/10.1007/BF00289586
State	Published - Aug 1981

ASJC Scopus subject areas

Software
Information Systems
Computer Networks and Communications

Access to Document

10.1007/BF00289586

Cite this

@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 = aug,

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

SN - 0001-5903

VL - 16

SP - 1

EP - 13

JO - Acta Informatica

JF - Acta Informatica

IS - 1

ER -

A characterization of database graphs admitting a simple locking protocol

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this