A Hybrid Concurrency Control without Deadlock based on Reordering


Sung-Ho Cho, Journal of Information Processing Systems Vol. 7, No. 6, pp. 79-86, Dec. 2006  


Keywords: Concurrency Control, Hybrid Concurrency Control, Deadlock Free Scheme, Reordering Scheme
Fulltext:

Abstract

Many of concurrency control for client-sewer database systems have been proposed and studied in the literature. However, commonly known schemes do not manage to the case of dramatic changes in data contention because the data contention of database systems is changed for each cases. In this paper, we propose o hybrid concurrency control. The proposed scheme uses a optimistic scheme for the first-run transactions and a pessimistic scheme for the second-run transactions. By pre-claiming locks in the second phase, deadlocks which ore possible in pessimistic based concurrency control are prevented in our approach. In addition, the scheme ensures at most one re-execution even if the validation in the optimistic phase fails. By a detailed simulation, this paper examines the behaviors of the Distributed Optimistic Concurrency Control and the proposed scheme. The simulation study shows our scheme outperforms Distributed Optimistic Concurrency Control in our experimental result.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 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
[APA Style]
Cho, S. (2006). A Hybrid Concurrency Control without Deadlock based on Reordering. Journal of Internet Computing and Services, 7(6), 79-86.

[IEEE Style]
S. Cho, "A Hybrid Concurrency Control without Deadlock based on Reordering," Journal of Internet Computing and Services, vol. 7, no. 6, pp. 79-86, 2006.

[ACM Style]
Sung-Ho Cho. 2006. A Hybrid Concurrency Control without Deadlock based on Reordering. Journal of Internet Computing and Services, 7, 6, (2006), 79-86.