Skip to Main Content
Deadlock detection is very difficult in a distributed database system because no controller has complete and current information about the system and data dependencies. The deadlock problem is intrinsic to a distributed database system which employs locking as its concurrency control algorithm. This paper attempts a comprehensive study of deadlock detection in distributed database systems. Afterwards, a deadlock detection algorithm is presented. The algorithm is based on creating linear transaction structure (LTS), distributed transaction structure (DTS), finding local and global cycle, deciding priority Id of the transaction and local-global abortion. The proposed algorithm does not detect any false deadlock or exclude any really existing deadlocks. In this technique global deadlock is not dependent on the local deadlock.