An algorithm for concurrency control and recovery in replicated distributed databases
- 5 December 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 9 (4), 596-615
- https://doi.org/10.1145/1994.2207
Abstract
In a one-copy distributed database, each data item is stored at exactly one site. In a replicated database, some data items may be stored at multiple sites. The main motivation is improved reliability: by storing important data at multiple sites, the DBS can operate even though some sites have failed. This paper describes an algorithm for handling replicated data, which allows users to operate on data so long as one copy is “available.” A copy is “available” when (i) its site is up, and (ii) the copy is not out-of-date because of an earlier crash. The algorithm handles clean, detectable site failures, but not Byzantine failures or network partitions.Keywords
This publication has 22 references indexed in Scilit:
- Computation and communication in R*ACM Transactions on Computer Systems, 1984
- Multiversion concurrency control—theory and algorithmsACM Transactions on Database Systems, 1983
- Achieving robustness in distributed database systemsACM Transactions on Database Systems, 1983
- Transactions and consistency in distributed database systemsACM Transactions on Database Systems, 1982
- Lower bounds for algebraic decision treesJournal of Algorithms, 1982
- Reliability mechanisms for SDD-1ACM Transactions on Database Systems, 1980
- Consistency in Hierarchical Database SystemsJournal of the ACM, 1980
- The serializability of concurrent database updatesJournal of the ACM, 1979
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976