Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
