Abstract
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.
This research was partly supported by the German State Sachsen-Anhalt under FKZ 1987A/0025 and 1987/2527R.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
A. Buchmann, M. T. özsu, M. Hornick, D. Georgakopoulos, F. Manola. A Transaction Model for Active Distributed Object Systems. In [6].
P. K. Chrysanthis, K. Ramamritham. Synthesis of Extended Transaction Models Using ACTA. ACM Transaction on Database Systems, 19(3):450–491, 1994.
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.
A. K. Elmagarmid (ed.). Database Transaction Models For Advanced Applications. Morgan Kaufmann, 1992.
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.
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.
J. E. B. Moss. Nested Transactions: An Approach to Reliable Distributed Computing. MIT Press, Cambridge, MA, 1985.
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.
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.
K. Schwarz, C. Türker, G. Saake. Transitive Dependencies in Transaction Closures. In Proc. Int. Database Engineering and Applications Symposium, IDEAS’98, 1998.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwarz, K., Türker, C., Saake, G. (1998). Extending transaction closures by n-ary termination dependencies. In: Litwin, W., Morzy, T., Vossen, G. (eds) Advances in Databases and Information Systems. ADBIS 1998. Lecture Notes in Computer Science, vol 1475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057723
Download citation
DOI: https://doi.org/10.1007/BFb0057723
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64924-3
Online ISBN: 978-3-540-68309-4
eBook Packages: Springer Book Archive