Concurrency Control Using the Update Graph in Replicated Database Systems 


Vol. 9,  No. 4, pp. 587-602, Aug.  2002
10.3745/KIPSTD.2002.9.4.587


PDF
  Abstract

Replicated database system was emerged to resolve the problem of reduction of the availability and the reliability due to the communication failures and site errors generated at centralized database system. But if update transactions are many occurred, the update is equally executed for all replicated data. Therefore, there are many problems the same thing a message overhead generated by synchronization and the reduce of concurrency happened because of delaying the transaction. In this paper, I propose a new concurrency control algorithm for enhancing the degree of parallelism of the transaction in fully replicated database designed to improve the availability and the reliability. To improve the system performance in the replicated database should be performed the last operations in the submitted site of transactions and be independently executed update-only transactions composed of write-only transactions in all sites. I propose concurrency control method to maintain the consistency of the replicated database and reflect the result of update-only transactions in all sites. The superiority of the proposed method has been tested from the respondence and withdrawal rate. The results confirm the superiority of the proposed technique over classical correlation based method.

  Statistics


  Cite this article

[IEEE Style]

H. Y. Choi, G. S. Lee, B. H. Hwang, "Concurrency Control Using the Update Graph in Replicated Database Systems," The KIPS Transactions:PartD, vol. 9, no. 4, pp. 587-602, 2002. DOI: 10.3745/KIPSTD.2002.9.4.587.

[ACM Style]

Hee Young Choi, Guee Sang Lee, and Bu Hyun Hwang. 2002. Concurrency Control Using the Update Graph in Replicated Database Systems. The KIPS Transactions:PartD, 9, 4, (2002), 587-602. DOI: 10.3745/KIPSTD.2002.9.4.587.