Abstract: In Distributed Database Systems concurrency control is very important for transaction execution time and communication costs. In this paper I suggest a new method of concurrency control giving high priority in 3 read transactions which are waiting in the queue, every time an exclusive lock (after the execution of a write transaction) is released. This way the execution time is reduced significantly and at the same time read transactions waiting in the queue are executed and released from the queue without burdening the runtime of waiting write transactions. In the worst case, when many write transactions are waiting one after the other to be granted an exclusive lock and then served, granting a shared lock to 3 read transactions right after a write transaction has released it’s lock, the waiting time of these transactions is reduced significantly. Besides all these, we overcome the disadvantages of the traditional locking mechanism for Distributed Database Systems (DDBS), like the low transaction concurrency and the high communication costs.
Keywords: Locking, index-based, priority, global node.
Title: Three Read Priority Locking for Concurrency Control in Distributed Databases
Author: Christos Papanastasiou
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
