Sung-Ho Cho, Journal of Internet Computing and Services, Vol. 7, No. 6, pp. 79-86, Dec. 2006
Full Text:
Keywords: Concurrency Control, Hybrid Concurrency Control, Deadlock Free Scheme, Reordering Scheme

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
Cite this article