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

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