Distributed optimistic concurrency control with reduced rollback

Divyakant Agrawal, Arthur J. Bernstein, Pankaj Gupta, Soumitra Sengupta

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

Concurrency control algorithms have traditionally been based on locking and timestamp ordering mechanisms. Recently optimistic schemes have been proposed. In this paper a distributed, multi-version, optimistic concurrency control scheme is described which is particularly advantageous in a query-dominant environment. The drawbacks of the original optimistic concurrency control scheme, namely that inconsistent views may be seen by transactions (potentially causing unpredictable behavior) and that read-only transactions must be validated and may be rolled back, have been eliminated in the proposed algorithm. Read-only transactions execute in a completely asynchronous fashion and are therefore processed with very little overhead. Furthermore, the probability that read-write transactions are rolled back has been reduced by generalizing the validation algorithm. The effects of global transactions on local transaction processing are minimized. The algorithm is also free from dedlock and cascading rollback problems.

Original languageEnglish
Pages (from-to)45-59
Number of pages15
JournalDistributed Computing
Volume2
Issue number1
DOIs
Publication statusPublished - 1 Mar 1987
Externally publishedYes

Fingerprint

Concurrency control
Concurrency Control
Distributed Control
Transactions
Transaction Processing
Timestamp
Locking
Inconsistent
Control Algorithm
Query
Processing

Keywords

  • Concurrency
  • Database systems
  • Distributed algorithms
  • Optimistic protocols
  • Rollbacks
  • Transactions

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Agrawal, D., Bernstein, A. J., Gupta, P., & Sengupta, S. (1987). Distributed optimistic concurrency control with reduced rollback. Distributed Computing, 2(1), 45-59. https://doi.org/10.1007/BF01786254

Distributed optimistic concurrency control with reduced rollback. / Agrawal, Divyakant; Bernstein, Arthur J.; Gupta, Pankaj; Sengupta, Soumitra.

In: Distributed Computing, Vol. 2, No. 1, 01.03.1987, p. 45-59.

Research output: Contribution to journalArticle

Agrawal, D, Bernstein, AJ, Gupta, P & Sengupta, S 1987, 'Distributed optimistic concurrency control with reduced rollback', Distributed Computing, vol. 2, no. 1, pp. 45-59. https://doi.org/10.1007/BF01786254
Agrawal, Divyakant ; Bernstein, Arthur J. ; Gupta, Pankaj ; Sengupta, Soumitra. / Distributed optimistic concurrency control with reduced rollback. In: Distributed Computing. 1987 ; Vol. 2, No. 1. pp. 45-59.
@article{02c2459310554ac7ac9969d576a854a1,
title = "Distributed optimistic concurrency control with reduced rollback",
abstract = "Concurrency control algorithms have traditionally been based on locking and timestamp ordering mechanisms. Recently optimistic schemes have been proposed. In this paper a distributed, multi-version, optimistic concurrency control scheme is described which is particularly advantageous in a query-dominant environment. The drawbacks of the original optimistic concurrency control scheme, namely that inconsistent views may be seen by transactions (potentially causing unpredictable behavior) and that read-only transactions must be validated and may be rolled back, have been eliminated in the proposed algorithm. Read-only transactions execute in a completely asynchronous fashion and are therefore processed with very little overhead. Furthermore, the probability that read-write transactions are rolled back has been reduced by generalizing the validation algorithm. The effects of global transactions on local transaction processing are minimized. The algorithm is also free from dedlock and cascading rollback problems.",
keywords = "Concurrency, Database systems, Distributed algorithms, Optimistic protocols, Rollbacks, Transactions",
author = "Divyakant Agrawal and Bernstein, {Arthur J.} and Pankaj Gupta and Soumitra Sengupta",
year = "1987",
month = "3",
day = "1",
doi = "10.1007/BF01786254",
language = "English",
volume = "2",
pages = "45--59",
journal = "Distributed Computing",
issn = "0178-2770",
publisher = "Springer Verlag",
number = "1",

}

TY - JOUR

T1 - Distributed optimistic concurrency control with reduced rollback

AU - Agrawal, Divyakant

AU - Bernstein, Arthur J.

AU - Gupta, Pankaj

AU - Sengupta, Soumitra

PY - 1987/3/1

Y1 - 1987/3/1

N2 - Concurrency control algorithms have traditionally been based on locking and timestamp ordering mechanisms. Recently optimistic schemes have been proposed. In this paper a distributed, multi-version, optimistic concurrency control scheme is described which is particularly advantageous in a query-dominant environment. The drawbacks of the original optimistic concurrency control scheme, namely that inconsistent views may be seen by transactions (potentially causing unpredictable behavior) and that read-only transactions must be validated and may be rolled back, have been eliminated in the proposed algorithm. Read-only transactions execute in a completely asynchronous fashion and are therefore processed with very little overhead. Furthermore, the probability that read-write transactions are rolled back has been reduced by generalizing the validation algorithm. The effects of global transactions on local transaction processing are minimized. The algorithm is also free from dedlock and cascading rollback problems.

AB - Concurrency control algorithms have traditionally been based on locking and timestamp ordering mechanisms. Recently optimistic schemes have been proposed. In this paper a distributed, multi-version, optimistic concurrency control scheme is described which is particularly advantageous in a query-dominant environment. The drawbacks of the original optimistic concurrency control scheme, namely that inconsistent views may be seen by transactions (potentially causing unpredictable behavior) and that read-only transactions must be validated and may be rolled back, have been eliminated in the proposed algorithm. Read-only transactions execute in a completely asynchronous fashion and are therefore processed with very little overhead. Furthermore, the probability that read-write transactions are rolled back has been reduced by generalizing the validation algorithm. The effects of global transactions on local transaction processing are minimized. The algorithm is also free from dedlock and cascading rollback problems.

KW - Concurrency

KW - Database systems

KW - Distributed algorithms

KW - Optimistic protocols

KW - Rollbacks

KW - Transactions

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

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

U2 - 10.1007/BF01786254

DO - 10.1007/BF01786254

M3 - Article

VL - 2

SP - 45

EP - 59

JO - Distributed Computing

JF - Distributed Computing

SN - 0178-2770

IS - 1

ER -