Computing Rules for Detecting Contradictory Transaction Termination Dependencies

Authors:
Kerstin Schwarz;Can Türker;Gunter Saake
Affiliations:
-;-;-
Venue:
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Year:
1999

Citing 7
Cited 0

A transaction model for active distributed object systems

Database transaction models for advanced applications
Synthesis of extended transaction models using ACTA

ACM Transactions on Database Systems (TODS)
Using semantic knowledge for transaction processing in a distributed database

ACM Transactions on Database Systems (TODS)
Synthesizing Distributed Constrained Events from Transactional Workflow

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
A Transactional Model for Long-Running Activities

VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
The Dependency Manager: A Base Service for Transactional Workflow Management

RIDE '96 Proceedings of the 6th International Workshop on Research Issues in Data Engineering (RIDE '96) Interoperability of Nontraditional Database Systems
Transitive Dependencies in Transaction Closures

IDEAS '98 Proceedings of the 1998 International Symposium on Database Engineering & Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Complex applications consist of a large set of interrelated transactions. Often, it is very difficult for the application/transaction designer to get a grasp of the transitive relationships among the transactions of a complex application. In this paper, we discuss transitive termination dependencies under consideration of transaction compensation and present an algorithm to derive a set of rules for reasoning about transitive dependencies. These rules may help the designer in understanding the entire semantics of a complex application and detecting contradictory dependency specifications.