Abstract
Distributed database system provides resource sharing environment for optimal performance of various database activities, especially when data is spread over a large number of sites. Distributed nature of transactions occurring at different sites and requiring resources from diverse sites pose various operational problems, such as deadlocks, concurrency and data recovery. A deadlock may occur when a transaction enters into wait state which request resource from other blocked transactions. The deadlocks are handled in three phases namely deadlock detection, deadlock avoidance and deadlock detection. Various algorithms have been discussed in the literature for deadlock detection and resolution. These algorithms quite often fail to detect deadlock over distributed database. In this paper an attempt has been made to develop an algorithm for distributed deadlock detection at local and global levels. The author have developed local transaction structure to deal with deadlock at local level and distributed transaction structure at global level
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.
