Hector Garcia-Molina
Kenneth Salem
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.
- Ande81a Anderson, T and P A Lee, Fault Tolerance, Pr, nctple6 and Pract, ce, Prentice-Hall International, London, 1981Google Scholar
- Date81a Date, C J, An Introduction to Databas# Systems, (3rd Ed, tton), Addison-Wesley, Reading, MA, 1981 Google ScholarDigital Library
- Garc83a Garcla-Mollna, Hector, "Using Semanttc Knowledge for Transaction Processing m a Distributed Database," A CM Transactton8 on Database Systems, vol 8, no 2, pp 186- 213, June 1983 Google ScholarDigital Library
- Giff85a Glfford, David K and James E Donahue, "Coordinating Independent Atomic Actions," Proceedm#8 of IEEE COMPCON, San Francisco, CA, February, 1985Google Scholar
- Gray78a Gray, Jim, "Notes on Data Base Operating Systems," m Operat=ng System8 An Advanced Course, ed G Seegmt#ller, pp 393-481, Sprmger-Verlag, 1978 Google ScholarDigital Library
- Gray81a Gray, Jim, "The Transaction Concept Virtues and Limitations," Proceeding8 of the Seventh Int'l Conference on Very Large Databases, pp 144-154, IEEE, Cannes, France, Sept, 1981Google Scholar
- Gray81b Gray, Jim, Pete Homan, Ron Obermarek, and Hank Korth, "A Straw Man Analysis of Probablhty of Waiting and Deadlock," IBM Research Report RJ3066 (38112), IBM Research Laboratory, San Jose, Cahforma, Feb, 1981Google Scholar
- Hadz82a Hadzllacos, Vassos, "An Algomthm for Minimizing Roll Back Cost," Proc A CM Syrup on PODS, pp 93-97, Los Angeles, CA, March, 1982 Google ScholarDigital Library
- Hamm80a Hammer, Machael and David Shipman, "Rehablhty Mechamsms for SDD-1 A System for Distributed Databases," ACM Transaction6 on Database Systems, vol 5, pp 431-466, Deeember, 1980 Google ScholarDigital Library
- Horn74a Hormng, J J, H C Lauer, P M Melhar- Smith, and B Randell, "A Program Structure for Error Detection and Recovery," m Lecture Note8 in Computer Sctence 16, ed C Kamer, Sprmger-Verlag, Berhn, 1974Google Scholar
- Kort85a Korth, Henry F and Won Klm, "A Concurrency Control Scheme for CAD Transactions," Teehmeal Report TR-85-34, Dept of Computer Science, Umv of Texas at Austin, December, 1985 Google ScholarDigital Library
- Lync83a Lynch, Nancy, '#Multflevel Atomlelty- A New Correctness Cntermn for Database Concurrency Control," A CM Transactions on Database Systems, vo} 8, no 4, pp 484- 502, December, 1983 Google ScholarDigital Library
- Lync86a Lynch, Nancy and Michael Merntt, "Introductmn to the Theory of Nested Transactions," unpubhshed, M I T, June, 1986Google Scholar
- Mossa Moss, J Elhot B, "Nested Transactmns An Introductmn," unpublished, U S Army War CollegeGoogle Scholar
- Norm83a Norman, Alan and Mark Anderton, "EMPACT A dmtnbuted database apphcatmn," Proc National Computer Conference, pp 203-217, AFIPS Press, 1983Google Scholar
- Rand78a Randell, B, P A Lee, and P C Treleaven, "Rehabfllty m Computing System Design," Computsng Surveys, vol 10, no 2, pp 123- 165, ACM, June, 1978 Google ScholarDigital Library
- Spec83a Spector, Alfred Z and Peter M Schwarz, "Transactmns A Construct for Rehable Dmtnbuted Computing," Operating Systems Remew, vol 17, no 2, pp 18-35, ACM SIGOPS, April, 1983 Google ScholarDigital Library
- Ullm82a Ullman, Jeffrey D, Prmcsple8 of Databa6e Systems, (Sad Edltton), Computer Scmnce Press, Rockvflle, MD, 1982Google Scholar
Index Terms
- Sagas
Recommendations
Sagas
SIGMOD '87: Proceedings of the 1987 ACM SIGMOD international conference on Management of dataLong 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 ...
Comments