Achieving high availability in distributed databases
- 1 July 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 14 (7) , 886-896
- https://doi.org/10.1109/32.42732
Abstract
An approach is presented for managing distributed database systems in the face of communication failures and network partitions. The approach is based on the idea of dividing the database into fragments and assigning each fragment a controlling entity called an agent. The goals achieved by this approach include high data availability and the ability to operate without promptly and correctly detecting partitions. A correctness criterion for transaction execution, called fragmentwise serializability, is introduced. It is less strict than the conventional serializability, but provides a valuable alternative for some applications.Keywords
This publication has 8 references indexed in Scilit:
- Consistency in a partitioned network: a surveyACM Computing Surveys, 1985
- Optimism and consistency in partitioned distributed database systemsACM Transactions on Database Systems, 1984
- Increasing availability in partitioned database systemsPublished by Association for Computing Machinery (ACM) ,1984
- Transactions and consistency in distributed database systemsACM Transactions on Database Systems, 1982
- Resilient Extended True-Copy Token Scheme for a Distributed Database SystemIEEE Transactions on Software Engineering, 1982
- Concurrency Control in Distributed Database SystemsACM Computing Surveys, 1981
- 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