Synonyms
Deadlocks in distributed database systems
Definition
In a database that supports locking protocol, accesses to data are controlled using locks. Whenever a transaction needs to access a shared object, it will be granted a lock (and hence access) to the object if there is no other conflicting locks on the object; otherwise, the requesting transaction has to wait. A deadlock occurs when transactions accessing shared data objects are waiting indefinitely in a circular fashion until a special action (such as aborting one of the transactions) is taken. In a distributed database environment, deadlocks can occur locally at a single site, or across sites where a chain of transactions may be waiting for one another to release the locks over a set of shared objects.
For example, consider two data objects o1 and o2 stored at site 1 and site 2 respectively. Suppose two transactions, T1 and T2, initiated at site 1 and site 2, are updating o1 and o2 concurrently. As T1 is updating o1at...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Abonamah AA, Elmagarmid A. A survey of deadlock detection algorithms in distributed database systems. In: Advances in distributed and parallel processing. System paradigms and methods, vol. 1; 1994. p. 310–41.
Bracha G, Sam T. Distributed deadlock detection. Distrib Comput. 1985;2(3):127–38.
Chandy KM, Lamport L. Distributed snapshots: determining global states of distributed systems. ACM Trans Comput Syst. 1986;3(1):63–75.
Elmagarmid AK. A survery of distributed deadlock algorithms. ACM SIGMOD Rec. 1986;15(3):37–45.
Gray J. Notes on data base operating systems. In: Advanced Course: Operating Systems; 1978. p. 393–481.
Ho Gray S, Ramamoorthy CV. Protocols for deadlock detection in distributed database systems. IEEE Trans Softw Eng. 1982;8(6):554–7.
Knapp E. Deadlock detection in distributed databases. ACM Comput Surv. 1987;19(4):303–28.
Krivokapić N, Kemper A, Gudes E. Deadlock detection in distributed database systems: a new algorithm and a comparative performance analysis. VLDB J. 1999;8(2):79–100.
Makki K, Pissinou N. Detection and resolution of deadlocks in distributed database systems. In: Proceedings of the International Conference on Information and Knowledge Management; 1995. p. 411–6.
Menascé DA, Muntz R. Locking and deadlock detection in distributed data bases. IEEE Trans Softw Eng. 1997;5(3):195–202.
Mohan C, Lindsay, Bruce G, Obermarck R. Transaction management in the R* distributed database management system. ACM Trans Database Syst. 1986;11(4):378–96.
Özsu MT, Valduriez P. Principles of distributed database systems. 2nd ed. Upper Saddle River: Prentice-Hall; 1999.
Roesler M, Burkhard WA, Cooper KB. Efficient deadlock resolution for lock-based concurrency control schemes. In: Proceedings of the 18th International Conference on Distributed Computing Systems; 1998. p. 224–33.
Singhal M. Deadlock detection in distributed systems. Computer. 1989;22(11):37–48.
Stonebraker M. The design and implementation of distributed ingres. In: The INGRES papers: anatomy of a relational database system; 1986. p. 187–96.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Tok, W.H. (2018). Distributed Deadlock Management. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_711
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_711
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering