Encyclopedia of Database Systems

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

Distributed Transaction Management

  • Wee Hyong TokEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_710


Transaction management in distributed database systems


Distributed transaction management deals with the problems of always providing a consistent distributed database in the presence of a large number of transactions (local and global) and failures (communication link and/or site failures). This is accomplished through (i) distributed commit protocols that guarantee atomicity property; (ii) distributed concurrency control techniques to ensure consistency and isolation properties; and (iii) distributed recovery methods to preserve consistency and durability when failures occur.

Historical Background

A transaction is a sequence of actions on a database that forms a basic unit of reliable and consistent computing, and satisfies the ACID property. In a distributed database system (DDBS), transactions may be local or global. In local transactions, the actions access and update data in a single site only, and hence it is straightforward to ensure the ACID property....

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Alsberg P, Day JD. A principle for resilient sharing of distributed resources. In: Proceedings of the 2nd International Conference on Software Engineering; 1976. p. 562–70.Google Scholar
  2. 2.
    Badal DZ. Correctness of concurrency control and implications for distributed databases. In: Proceedings of the 3rd Computer Software and Applications Conference; 1979. p. 588–94.Google Scholar
  3. 3.
    Balter R, Berard P, Decitre P. Why control of the concurrency level in distributed systems is more fundamental than deadlock management. In: Proceedings of the ACM SIGACT-SIGOPS 1st Symposium on the Principles of Distributed Computing; 1982. p. 183–93.Google Scholar
  4. 4.
    Bernstein PA, Goodman N. Concurrency control in distributed database systems. ACM Comput Surv. 1981;13(2):185–221.CrossRefMathSciNetGoogle Scholar
  5. 5.
    Bernstein PA, Hadzilacos V, Goodman N. Concurrency control and recovery in database systems. Boston: Addison-Wesley; 1987.Google Scholar
  6. 6.
    Casanova MA. The concurrency control problem for database systems, Lecture Notes in Computer Science, vol. 116. Berlin: Springer; 1981.zbMATHGoogle Scholar
  7. 7.
    Chrysanthis PK, Samaras G, Al-Houmaily YJ. Recovery and performance of atomic commit processing in distributed database systems, Chapter 13. In: Kumar V, Hsu M, editors. Recovery mechanisms in database systems. Upper Saddle River: Prentice-Hall; 1998.Google Scholar
  8. 8.
    Gray J. Notes on data base operating systems. In: Bayer R, Graham R, Seegmuller G, editors. Operating systems – an advanced course, Lecture notes in computer science, vol. 60. Berlin: Springer; 1978. p. 393–481.CrossRefGoogle Scholar
  9. 9.
    Hadzilacos T, Yannakakis M. Deleting completed transactions. In: Proceedings of the 5th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems; 1986. p. 43–6.Google Scholar
  10. 10.
    Lampson B, Sturgis H. Crash recovery in a distributed data storage system. Technical report, Computer Science Laboratory, Xerox Palo Alto Research Center, 1976.Google Scholar
  11. 11.
    Mohan C, Lindsay BG, Obermarck R. Transaction management in the R* distributed database management system. ACM Trans Database Syst. 1986;11(4):378–96.CrossRefGoogle Scholar
  12. 12.
    Shapiro R, Millstein R. Reliability and fault recovery in distributed processing. In: Oceans ’77 Conference Record: Third Annual Combined Conference; 1977. p. 425–29.Google Scholar
  13. 13.
    Skeen D. Non-blocking commit protocols. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. p. 133–42.Google Scholar
  14. 14.
    Stonebraker M, Neuhold EJ. A distributed database version of ingres. In: Proceedings of the 2nd Berkeley Workshop on Distributed Data Management and Computer Networks; 1977. p. 19–36.Google Scholar
  15. 15.
    The Tandem Performance Group. Tandem database group – nonstop sql: a distributed, high-performance, high-availability implementation of sql. In: Proceedings of the 2nd International Workshop on High Performance Transaction Systems; 1987. p. 60–104.Google Scholar

Copyright information

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

Authors and Affiliations

  1. 1.National University of SingaporeSingaporeSingapore

Section editors and affiliations

  • Kian-Lee Tan
    • 1
  1. 1.Dept. of Computer ScienceNational Univ. of SingaporeSingaporeSingapore