Consistency in a partitioned network: a survey
- 1 September 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 17 (3) , 341-370
- https://doi.org/10.1145/5505.5508
Abstract
Recently, several strategies have been proposed for transaction processing in partitioned distributed database systems with replicated data. These strategies are surveyed in light of the competing goals of maintaining correctness and achieving high availability. Extensions and combinations are then discussed, and guidelines are presented for selecting strategies for particular applications.Keywords
This publication has 26 references indexed in Scilit:
- Optimism and consistency in partitioned distributed database systemsACM Transactions on Database Systems, 1984
- Multilevel atomicity—a new correctness criterion for database concurrency controlACM Transactions on Database Systems, 1983
- Guardians and Actions: Linguistic Support for Robust, Distributed ProgramsACM Transactions on Programming Languages and Systems, 1983
- Transactions and consistency in distributed database systemsACM Transactions on Database Systems, 1982
- Read-only transactions in a distributed databaseACM Transactions on Database Systems, 1982
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981
- The Recovery Manager of the System R Database ManagerACM Computing Surveys, 1981
- Reliability mechanisms for SDD-1ACM Transactions on Database Systems, 1980
- Concurrency control in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1980
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976