Extending transaction closures by n-ary termination dependencies

  • Kerstin Schwarz
  • Can Türker
  • Gunter Saake
Regular Papers Collaborative Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1475)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. C. Attie, M. P. Singh, E. A. Emerson, A. Sheth, M. Rusinkiewicz. Scheduling Workflows by Enforcing Intertask Dependencies. Distributed Systems Engineering, 3(4):222–238, 1996.CrossRefGoogle Scholar
  2. 2.
    A. Buchmann, M. T. özsu, M. Hornick, D. Georgakopoulos, F. Manola. A Transaction Model for Active Distributed Object Systems. In [6].Google Scholar
  3. 3.
    P. K. Chrysanthis, K. Ramamritham. Synthesis of Extended Transaction Models Using ACTA. ACM Transaction on Database Systems, 19(3):450–491, 1994.CrossRefGoogle Scholar
  4. 4.
    U. Dayal, M. Hsu, R. Ladin. A Transaction Model for Long-Running Activities. In G. M. Lohmann, A. Sernadas, R. Camps (eds.), Proc. VLDB’91, pp. 113–122. Morgan Kaufmann, 1991.Google Scholar
  5. 5.
    A. K. Elmagarmid (ed.). Database Transaction Models For Advanced Applications. Morgan Kaufmann, 1992.Google Scholar
  6. 6.
    D. Georgakopoulos, M. Hornick, A. Sheth. An Overview of Workflow Management: From Process Modeling to Workflow Automation Infrastructure. Distributed and Parallel Databases, 3(2):119–153, 1995.CrossRefGoogle Scholar
  7. 7.
    M. Hsu, R. Ladin, D. R. McCarthy. An Execution Model For Active Data Base Management Systems. In C. Beeri, J. W. Schmidt, U. Dayal (eds.), Proc. 3rd Int. Conf. on Data and Knowledge Bases: Improving Usability and Responsiveness, 1988, pp. 171–179, Morgan Kaufmann, 1988.Google Scholar
  8. 8.
    J. E. B. Moss. Nested Transactions: An Approach to Reliable Distributed Computing. MIT Press, Cambridge, MA, 1985.Google Scholar
  9. 9.
    M. Rusinkiewicz, W. Klas, T. Tesch, J. Wäsch, P. Muth. Towards a Cooperative Transaction Model — The Cooperative Activity Model. In U. Dayal, P. M. D. Gray, S. Nishio (eds.), Proc. VLDB’95, pp. 194–205, Morgan Kaufmann, 1995.Google Scholar
  10. 10.
    K. Schwarz, C. Türker, G. Saake. Analyzing and Formalizing Dependencies in Generalized Transaction Structures. In Proc. Int. Workshop on Issues and Applications of Database Technology, IADT’98, 1998.Google Scholar
  11. 11.
    K. Schwarz, C. Türker, G. Saake. Transitive Dependencies in Transaction Closures. In Proc. Int. Database Engineering and Applications Symposium, IDEAS’98, 1998.Google Scholar
  12. 12.
    J. Tang, J. Veijalainen. Enforcing Inter-task Dependencies in Transactional Workflows. In S. Laufmann, S. Spaccapietra, T. Yokoi (eds.), Proc. 3rd Int. Conf. on Cooperative Information Systems, CoopIS’95, pp. 72–86, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Kerstin Schwarz
    • 1
  • Can Türker
    • 1
  • Gunter Saake
    • 1
  1. 1.Institut für Technische und Betriebliche InformationssystemeOtto-von-Guericke-Universität MagdeburgMagdeburgGermany

Personalised recommendations