Extending Transaction Closures by N-ary Termination Dependencies

Transaction dependencies have been recognized as a valuable method in describing restrictions on the executions of sets of transactions. A transaction closure is a generalized transaction structure consisting of a set of related transactions which are connected by special dependencies. Traditionally, relationships between transactions are formulated by binary dependencies. However, there are applications scenarios where dependencies must be specified among more than two transactions. Since n-ary dependencies cannot be expressed by binary dependencies, appropriate extensions are required. In this paper, we extend the concept of transaction closure by ternary termination dependencies. We show how n-ary termination dependencies can be expressed by binary and ternary termination dependencies. As a result, we present rules for reasoning about the combination of these termination dependencies.

[1]  Jian Tang,et al.  Enforcing Inter-Task Dependencies in Transactional Workflows , 1995, CoopIS.

[2]  Matthias Nussbaum.  Database Transaction Models for Advanced Applications , 1992 .

[3]  Amit P. Sheth,et al.  Scheduling workflows by enforcing intertask dependencies , 1996, Distributed Syst. Eng..

[4]  Umeshwar Dayal,et al.  A Transactional Model for Long-Running Activities , 1991, VLDB.

[5]  Gunter Saake,et al.  Execution dependencies in transaction closures , 1998, Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122).

[6]  Meichun Hsu,et al.  An Execution Model for Active Data Base Management Systems , 1988, JCDKB.

[7]  A. Elmagarmid.  Database transaction models for advanced applications , 1992 .

[8]  Alejandro P. Buchmann,et al.  A Transaction Model for Active Distributed Object Systems , 1992, Database Transaction Models for Advanced Applications.

[9]  Gunter Saake,et al.  Analyzing and Formalizing Dependencies in Generalized Transaction Structures , 1998, IADT.

[10]  Patrick Valduriez,et al.  Distributed and parallel database systems , 1996, CSUR.

[11]  Gunter Saake,et al.  Transitive dependencies in transaction closures , 1998, Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).

[12]  E. B. Moss,et al.  Nested Transactions: An Approach to Reliable Distributed Computing , 1985 .

[13]  Panos K. Chrysanthis,et al.  Synthesis of extended transaction models using ACTA , 1994, TODS.

[14]  Thomas Tesch,et al.  Towards a Cooperative Transaction Model - The Cooperative Activity Model , 1995, VLDB.