A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
- 30 September 1981
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 2 (3), 211-226
- https://doi.org/10.1016/0196-6774(81)90023-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The serializability of concurrent database updatesJournal of the ACM, 1979
- Locking policies: Safety and freedom from deadlockPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- An optimality theory of concurrency control for databasesPublished by Association for Computing Machinery (ACM) ,1979
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975