A Concurrency Control Technique Using Optimistic Atomic Broadcast in Replicated Database Systems


The KIPS Transactions:PartD, Vol. 8, No. 5, pp. 543-552, Oct. 2001
10.3745/KIPSTD.2001.8.5.543,   PDF Download:

Abstract

To process transactions in fully replicated databases, an atomic broadcast is mainly used. In the case of using atomic broadcast, transactions can be delayed because of the coordinating step among servers before processing the transaction. In this paper, we propose an algorithm to resolve the problem of transaction delay. In the proposed algorithm, the transactions are processed by using the optimistic method. The read operations of a transaction are performed in the site that it is submitted and its write operations execute its updates atomically in all replicated sites. Since the transactions submitted to each site are performed independently in that site, their parallelism is enhanced and the transaction delay is prevented. The serializability of transactions is ensured by checking the sequence number of transactions in the completion-inspection step.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. Y. Choi and B. H. Hwang, "A Concurrency Control Technique Using Optimistic Atomic Broadcast in Replicated Database Systems," The KIPS Transactions:PartD, vol. 8, no. 5, pp. 543-552, 2001. DOI: 10.3745/KIPSTD.2001.8.5.543.

[ACM Style]
Hee Young Choi and Bu Hyun Hwang. 2001. A Concurrency Control Technique Using Optimistic Atomic Broadcast in Replicated Database Systems. The KIPS Transactions:PartD, 8, 5, (2001), 543-552. DOI: 10.3745/KIPSTD.2001.8.5.543.