A proof technique for concurrency control and recovery algorithms for replicated databases
- 1 March 1987
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 2 (1) , 32-44
- https://doi.org/10.1007/bf01786253
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Serializability theory for replicated databasesJournal of Computer and System Sciences, 1985
- Consistency in a partitioned network: a surveyACM Computing Surveys, 1985
- An efficient, fault-tolerant protocol for replicated data managementPublished by Association for Computing Machinery (ACM) ,1985
- An algorithm for concurrency control and recovery in replicated distributed databasesACM Transactions on Database Systems, 1984
- Achieving robustness in distributed database systemsACM Transactions on Database Systems, 1983
- A recovery algorithm for a distributed database systemPublished by Association for Computing Machinery (ACM) ,1983
- Concurrency Control in Distributed Database SystemsACM Computing Surveys, 1981
- Formal Aspects of Serializability in Database Concurrency ControlIEEE Transactions on Software Engineering, 1979
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976