Nested transactions: an approach to reliable distributed computing
Nested transactions: an approach to reliable distributed computing
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
ASSET: a system for supporting extended transactions
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Ensuring relaxed atomicity for flexible transactions in multidatabase systems
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
An overview of workflow management: from process modeling to workflow automation infrastructure
Distributed and Parallel Databases - Special issue on software support for work flow management
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
Advanced Transaction Models and Architectures
Advanced Transaction Models and Architectures
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
A taxonomy of correctness criteria in database applications
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
Deadlock detection, which is fairly well-understood for the traditional transaction model used for concurrency control to databases, needs to be revisited when dealing with advanced transaction models. This is because a transaction in these models is organized as a collection of tasks; specific decisions (such as commit or abort) about a task may be based on the outcome or status of other tasks in the same transaction. Although this gives flexibility to the application programmer, a set of concurrent transactions may contain two types of dependencies: data and transaction dependencies. Commit and abort dependencies specifying constraints on transaction termination order are well-known examples of transaction dependencies. Data dependencies arise when transactions concurrently access common data items under conflicting modes. In this paper, we show that in the face of these dependencies, deadlocks may arise that the conventional deadlock detection algorithms are not able to detect. We show that transaction waiting states are characterized by AND-OR graphs and propose an algorithm for detecting deadlocks in these graphs. This algorithm has a computational complexity linear in the number of nodes and edges of the AND-OR graphs. We prove the correctness of our algorithm by characterizing deadlocks in a subclass of Petri nets equivalent to AND-OR graphs.