Five color concurrency control protocol. Non-two-phase locking in general databases

Partha Dasgupta, Zvi M. Kedem

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Concurrency control protocols based on two-phase locking are a popular family of locking protocols that preserve serializability in general (unstructured) database systems. A concurrency control algorithm (for databases with no inherent structure) is presented that is practical, non two-phase, and allows varieties of serializable logs not possible with any commonly known locking schemes. All transactions are required to predeclare the data they intend to read or write. Using this information, the protocol anticipates the existence (or absence) of possible conflicts and hence can allow non-two-phase locking. It is well known that serializability is characterized by acyclicity of the conflict graph representation of interleaved executions. The two-phase locking protocols allow only forward growth of the paths in the graph. The Five Color protocol allows the conflict graph to grow in any direction (avoiding two-phase constraints) and prevents cycles in the graph by maintaining transaction access information in the form of data-item markers. The read and write set information can also be used to provide relative immunity from deadlocks.

Original languageEnglish (US)
Pages (from-to)281-307
Number of pages27
JournalACM Transactions on Database Systems
Volume15
Issue number2
DOIs
StatePublished - Jun 1990
Externally publishedYes

Fingerprint

Concurrency control
Color
Network protocols

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this

Five color concurrency control protocol. Non-two-phase locking in general databases. / Dasgupta, Partha; Kedem, Zvi M.

In: ACM Transactions on Database Systems, Vol. 15, No. 2, 06.1990, p. 281-307.

Research output: Contribution to journalArticle

@article{acabf04a063e403fa37851a4724e2ead,
title = "Five color concurrency control protocol. Non-two-phase locking in general databases",
abstract = "Concurrency control protocols based on two-phase locking are a popular family of locking protocols that preserve serializability in general (unstructured) database systems. A concurrency control algorithm (for databases with no inherent structure) is presented that is practical, non two-phase, and allows varieties of serializable logs not possible with any commonly known locking schemes. All transactions are required to predeclare the data they intend to read or write. Using this information, the protocol anticipates the existence (or absence) of possible conflicts and hence can allow non-two-phase locking. It is well known that serializability is characterized by acyclicity of the conflict graph representation of interleaved executions. The two-phase locking protocols allow only forward growth of the paths in the graph. The Five Color protocol allows the conflict graph to grow in any direction (avoiding two-phase constraints) and prevents cycles in the graph by maintaining transaction access information in the form of data-item markers. The read and write set information can also be used to provide relative immunity from deadlocks.",
author = "Partha Dasgupta and Kedem, {Zvi M.}",
year = "1990",
month = "6",
doi = "10.1145/78922.78927",
language = "English (US)",
volume = "15",
pages = "281--307",
journal = "ACM Transactions on Database Systems",
issn = "0362-5915",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - Five color concurrency control protocol. Non-two-phase locking in general databases

AU - Dasgupta, Partha

AU - Kedem, Zvi M.

PY - 1990/6

Y1 - 1990/6

N2 - Concurrency control protocols based on two-phase locking are a popular family of locking protocols that preserve serializability in general (unstructured) database systems. A concurrency control algorithm (for databases with no inherent structure) is presented that is practical, non two-phase, and allows varieties of serializable logs not possible with any commonly known locking schemes. All transactions are required to predeclare the data they intend to read or write. Using this information, the protocol anticipates the existence (or absence) of possible conflicts and hence can allow non-two-phase locking. It is well known that serializability is characterized by acyclicity of the conflict graph representation of interleaved executions. The two-phase locking protocols allow only forward growth of the paths in the graph. The Five Color protocol allows the conflict graph to grow in any direction (avoiding two-phase constraints) and prevents cycles in the graph by maintaining transaction access information in the form of data-item markers. The read and write set information can also be used to provide relative immunity from deadlocks.

AB - Concurrency control protocols based on two-phase locking are a popular family of locking protocols that preserve serializability in general (unstructured) database systems. A concurrency control algorithm (for databases with no inherent structure) is presented that is practical, non two-phase, and allows varieties of serializable logs not possible with any commonly known locking schemes. All transactions are required to predeclare the data they intend to read or write. Using this information, the protocol anticipates the existence (or absence) of possible conflicts and hence can allow non-two-phase locking. It is well known that serializability is characterized by acyclicity of the conflict graph representation of interleaved executions. The two-phase locking protocols allow only forward growth of the paths in the graph. The Five Color protocol allows the conflict graph to grow in any direction (avoiding two-phase constraints) and prevents cycles in the graph by maintaining transaction access information in the form of data-item markers. The read and write set information can also be used to provide relative immunity from deadlocks.

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

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

U2 - 10.1145/78922.78927

DO - 10.1145/78922.78927

M3 - Article

AN - SCOPUS:0025446491

VL - 15

SP - 281

EP - 307

JO - ACM Transactions on Database Systems

JF - ACM Transactions on Database Systems

SN - 0362-5915

IS - 2

ER -