Abstract

A long-running transaction is an interaction of components from different systems. It must be executed as a single atomic action. The typical atomic technologies are not suitable for long-running transaction. Because long-running transaction could not use ACID semantic, this paper uses the set consistency notion and CSP to define the consistency of the long-running transaction. We give an algorithm to verify set consistency. The case study shows that the approach is effective.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.