Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Availability in partitioned replicated databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A weighted voting algorithm for replicated directories
Journal of the ACM (JACM)
A Pessimistic Consistency Control Algorithm for Replicated Files Which Achieves High Availability
IEEE Transactions on Software Engineering
Maintaining availability in partitioned replicated databases
ACM Transactions on Database Systems (TODS)
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Consistency and recovery control for replicated files
Proceedings of the tenth ACM symposium on Operating systems principles
An efficient, fault-tolerant protocol for replicated data management
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Detection of Mutual Inconsistency in Distributed Databases
Proceedings of the Third International Conference on Data Engineering
Managing Replicated Files in Partitioned Distributed Database Systems
Proceedings of the Third International Conference on Data Engineering
Proceedings of the Fifth International Conference on Data Engineering
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A principle for resilient sharing of distributed resources
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Hi-index | 0.00 |
Many algorithms exist in literature to manage replicated database objects. Some of these are dynamic and attempt to adapt to changing network configurations due to failures, particularly due to network partitioning. This paper presents a new dynamic algorithm for replication control with several desirable features: not only does it enhance the availability of read and write operations in failure conditions but also achieves this at a relatively low cost. This algorithm is based on the concept of views introduced originally by El Abbadi, Skeen and Cristian and improves on the dynamic voting ideas developed by many authors.