An optimal victim selection algorithm for removing global deadlocks in multidatabase systems

A time out mechanism based on a potential conflict graph has been applied to detect global deadlocks. In order to perform the time out mechanism better, we propose an optimal victim selection algorithm for resolving global deadlock in a multidatabase system. The algorithm selects a set of transactions with the minimal abortion cost to resolve global deadlocks. It makes the use of network flow techniques, and runs in time O(n/sup 3/), where n is the size of a subset of the global transactions.<
>