Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu


  • Kenneth SalemEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_724


A saga [ 3] is a sequence of atomic transactions T 1 , … , T n for which the following execution guarantee is made. Either the component transactions T i will all commit in the order:
$$ {T}_1{T}_2,\dots, {T}_n $$
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Chrysanthis PK, Ramamritham K. Synthesis of extended transaction models using ACTA. ACM Trans Database Syst. 1994;19(3):450–91.CrossRefGoogle Scholar
  2. 2.
    Garcia-Molina H. Using semantic knowledge for transaction processing in a distributed database. ACM Trans Database Syst. 1983;8(2):186–213.zbMATHCrossRefGoogle Scholar
  3. 3.
    Garcia-Molina H, Salem K. Sagas. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1987. p. 249–59.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.University of WaterlooWaterlooCanada

Section editors and affiliations

  • Panos K. Chrysanthis
    • 1
  1. 1.Department of Computer ScienceUniversity of PittsburghPittsburghUSA