Specification and execution of transactional workflows
Modern database systems
A survey and critique of advanced transaction models
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Global Scheduling for Flexible Transactions in Heterogeneous Distributed Database Systems
IEEE Transactions on Knowledge and Data Engineering
A Multidatabase Transaction Model for InterBase
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Using Flexible Transactions to Support Multi-System Telecommunication Applications
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Semantics and Architecture of Global Transaction Support in Workflow Environments
COOPIS '99 Proceedings of the Fourth IECIS International Conference on Cooperative Information Systems
Ensuring required failure atomicity of composite Web services
WWW '05 Proceedings of the 14th international conference on World Wide Web
Exploiting a database system in scheduling internet-based workflows
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
Ensuring recoverability in composing web services
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Relaxation of ACID properties in AuTrA, The adaptive user-defined transaction relaxing approach
Future Generation Computer Systems
The reliability of web services atomic commitment protocols
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
| Hi-index | 0.00 |
Transaction is the key mechanism to make service composition reliable. To ensure the relaxed atomicity of transactional composite service (TCS), existing research depends on the analysis to composition structure and exception handling mechanism. However, this approach can not handle various application-specific requirements, and causes lots of unnecessary failure recoveries or even aborts. In this paper, we propose a relaxed transaction model, including system mode, relaxed atomicity criterion, static checking algorithm and dynamic enforcement algorithm. Users can define different relaxed atomicity constraint for different TCS according to the specific application requirements, including accepted configurations and the preference order. The checking algorithm determines whether the constraint can be satisfied. The enforcement algorithm monitors the execution and performs transaction management works according to the constraint. Compared to existing work, our approach is flexible enough to handle complex application requirements and performs the transaction management works automatically. We apply the approach into web service composition language WS-BPEL and illustrate the above advantages through a concrete example.