The virtues of locking by symbolic names
- 31 December 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (4) , 536-556
- https://doi.org/10.1016/0196-6774(87)90049-6
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An algorithm for early unlocking of entities in database transactionsJournal of Algorithms, 1986
- Beyond two-phase lockingJournal of the ACM, 1985
- Locking ProtocolsJournal of the ACM, 1983
- A Family of Locking Protocols for Database Systems that Are Modeled by Directed GraphsIEEE Transactions on Software Engineering, 1982
- A Theory of Safe Locking Policies in Database SystemsJournal of the ACM, 1982
- Freedom from Deadlock of Safe Locking PoliciesSIAM Journal on Computing, 1982
- Concurrency control in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1980
- Consistency in Hierarchical Database SystemsJournal of the ACM, 1980
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976