Detection techniques for deadlockin distributed database system

Deadlock is defined as a fundamental problem in distributed environment. Its detection and resolution is also a very typical task due to this distributed behavior where resources are spread over different machine. Deadlock is a situation where one transaction is requesting for a resource which is hold by another transaction and also it itself holding a resource which is needed by another transaction. Deadlock effect the whole performance of the system. The most widely used algorithm for deadlock detection is Edge-chasing and diffusion computation based algorithm. Aprobé which is a special massage, and used for deadlock detection in Edge chasing algorithm, is sent through the outgoing edges. When the originator receives the probe massage back then it indicates that deadlock is recognized. Here we present different deadlock detection technique and different approaches in distributed database system for deadlock detection.