On the efficiency of cautious schedulers for database concurrency control?Why insist on two-phase locking?

1989 ◽  
Vol 1 (2) ◽  
pp. 177-195 ◽  
Author(s):  
Shojiro Nishio ◽  
Shinichi Taniguchi ◽  
Toshihide Ibaraki
Author(s):  
Manoj Kumar Gupta . ◽  
Rakesh Kumar Arora . ◽  
Bhoopesh Singh Bhati .

Concurrency control focuses on maintaining consistency and integrity of database through synchronized access. The complexity relating to concurrency control in a distributed context is very high as compared to centralized framework due to maintaining consistency within the multiple fragments / copies of the database. This paper consolidates and discusses various lock based concurrency control techniques for Distributed DBMS. The paper also presents a comparative study of various two phase locking based concurrency control techniques.


2019 ◽  
Vol 1 (2) ◽  
pp. 26-40
Author(s):  
Dardina Tasmere ◽  
Md. Nazmus Salehin

Concurrency control mechanisms including the wait, time-stamp and rollback mechanisms have been briefly discussed. The concepts of validation in optimistic approach are summarized in a detailed view. Various algorithms have been discussed regarding the degree of concurrency and classes of serializability. Practical questions relating arrival rate of transactions have been presented. Performance evaluation of concurrency control algorithms including degree of concurrency and system behavior have been briefly conceptualized. At last, ideas like multidimensional timestamps, relaxation of two-phase locking, system defined prewrites, flexible transactions and adaptability for increasing concurrency have been summarized.


2000 ◽  
Vol 42 (4) ◽  
pp. 257-273 ◽  
Author(s):  
N.B Al-Jumah ◽  
H.S Hassanein ◽  
M El-Sharkawi

The Two-Phase Locking of Multi-Version Concurrency Control (MV2PL) avoids conflicts of concurrent transactions by make them wait until conflicts get resolved. These conflicts of transactions may generate starvations and deadlocks in the system. The Transactions suffering from deadlocks are usually aborted and restarted from scratch. In multiuser systems, this “abort and restart” approach degrades the system‟s performance where higher conflicts for data or long running transactions occur. Restarting from scratch also generates a negative response loop in the system, because the system suffers additional overheads which may result into even more conflicts. In this paper, we are proposing a novel approach for conflict resolution in Multi-Version Concurrency Control for shared databases. Our mechanism quickly detects the conflicts using correctness criteria for serializability and resolves the conflicts between transactions and increases throughput.


Sign in / Sign up

Export Citation Format

Share Document