Sagas
- 1 December 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 16 (3) , 249-259
- https://doi.org/10.1145/38714.38742
Abstract
Long lived transactions (LLTs) hold on to database resources for relatively long periods of time, significantly delaying the termination of shorter and more common transactions. To alleviate these problems we propose the notion of a saga. A LLT is a saga if it can be written as a sequence of transactions that can be interleaved with other transactions. The database management system guarantees that either all the transactions in a saga are successfully completed or compensating transactions are run to amend a partial execution. Both the concept of saga and its implementation are relatively simple, but they have the potential to improve performance significantly. We analyze the various implementation issues related to sagas, including how they can be run on an existing system that does not directly support them. We also discuss techniques for database and LLT design that make it feasible to break up LLTs into sagas.Keywords
This publication has 7 references indexed in Scilit:
- Multilevel atomicity—a new correctness criterion for database concurrency controlACM Transactions on Database Systems, 1983
- Using semantic knowledge for transaction processing in a distributed databaseACM Transactions on Database Systems, 1983
- TransactionsACM SIGOPS Operating Systems Review, 1983
- An algorithm for minimizing roll back costPublished by Association for Computing Machinery (ACM) ,1982
- Reliability mechanisms for SDD-1ACM Transactions on Database Systems, 1980
- Reliability Issues in Computing System DesignACM Computing Surveys, 1978
- Notes on data base operating systemsPublished by Springer Nature ,1978