DISTRIBUTED MULTI-VERSION OPTIMISTIC CONCURRENCY CONTROL FOR RELATIONAL DATABASES.

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Concurrency control algorithms have traditionally been based on locking and timestamp ordering mechanisms. Recently, optimistic schemes have been proposed. Here a distributed, multiversion, 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, have been eliminated in the proposed algorithm. Read-only transactions execute in a completely asynchronous fashion and are therefore processed with very little overhead. As opposed to timestamp algorithms, read-only transactions cannot cause aborts of read-write transactions. The effects of global transactions on local transaction processing are minimized. The algorithm is also free from deadlock and cascading rollback problems.

Original languageEnglish
Title of host publicationProceedings - IEEE Computer Society International Conference
EditorsAlan G. Bell
PublisherIEEE
Pages416-421
Number of pages6
ISBN (Print)0818606924
Publication statusPublished - 1 Jan 1986

Publication series

NameProceedings - IEEE Computer Society International Conference

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Agrawal, D., Bernstein, A. J., Gupta, P., & Sengupta, S. (1986). DISTRIBUTED MULTI-VERSION OPTIMISTIC CONCURRENCY CONTROL FOR RELATIONAL DATABASES. In A. G. Bell (Ed.), Proceedings - IEEE Computer Society International Conference (pp. 416-421). (Proceedings - IEEE Computer Society International Conference). IEEE.