An Efficient Merged Concurrency Control Method for Concurrency Conflicts

Abstract

Traditional distributed transaction protocol typically included two-phase locking (2PL) or optimistic concurrency control (OCC). However, both of them have the problems when more concurrency conflicts existed in the conditions for large amount requirements of data and processing. In this paper, we propose one merged concurrency control method in the distributed single transaction to support for conflicts more efficiently. TPC-C experiments and results implied that our merged distributed transaction has better ability to handle concurrency conflicts, especially in the case of many conflicts. It can read, write and recall operations with fully utilizing temporal redundancy and data network and be suitable for large-scale data and computationally intensive projects.