Deadlock-freedom (and safety) of transactions in a distributed database

DOI10.1016/0022-0000(86)90017-6zbMath0625.68083OpenAlexW1973723007MaRDI QIDQ579973

Mihalis Yannakakis, Ouri Wolfson

Publication date: 1986

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(86)90017-6

zbMATH Keywords

lockingNP-harddistributed databaseconcurrency controldeadlock freedomgraph-theoretic formalization

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Is distributed locking harder?
• Optimal algorithms to compute the closure of a set of iso-rectangles
• Concurrency Control by Locking
• An algorithm for early unlocking of entities in database transactions
• The serializability of concurrent database updates
• Consistency in Hierarchical Database Systems
• A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
• Freedom from Deadlock of Safe Locking Policies
• A Theory of Safe Locking Policies in Database Systems
• The notions of consistency and predicate locks in a database system
• The NP-completeness column: An ongoing guide

This page was built for publication: Deadlock-freedom (and safety) of transactions in a distributed database