An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
How to assign votes in a distributed system
Journal of the ACM (JACM)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Journal of Management Information Systems - Special Issue: Database Management
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A dynamic majority determination algorithm for reconfiguration of network partitions
Information Sciences: an International Journal
A Pessimistic Consistency Control Algorithm for Replicated Files Which Achieves High Availability
IEEE Transactions on Software Engineering
A Dynamic Voting Scheme in Distributed Systems
IEEE Transactions on Software Engineering
A static pessimistic scheme for handling replicated databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Regeneration with Virtual Copies for Distributed Computing Systems
IEEE Transactions on Software Engineering
Achieving robustness in distributed database systems
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
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
Integrating Static and Dynamic Voting Protocols To Enhance File Availability
Proceedings of the Fourth International Conference on Data Engineering
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Analyzing dynamic voting using Petri nets
SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
Distributed and Parallel Databases
Analyzing reconfigurable algorithms for managing replicated data
Journal of Systems and Software
ICCC'11 Proceedings of the 2011 international conference on Computers and computing
Research notes: Research in MIS: the Rutgers perspective
International Journal of Information Management: The Journal for Information Professionals
| Hi-index | 0.00 |
We consider the problem of keeping a distributed database system that has been partitioned because of site or communication link failures partially operable while ensuring data consistency. A dynamic-voting-consistency algorithm is proposed, and its correctness is demonstrated. The proposed algorithm results in improved efficiency in executing read requests by not requiring a read quorum. This algorithm is effective in environments where the majority of user requests are "read" types of requests. Furthermore, the proposed algorithm results in efficient recovery by avoiding updating those data objects that are still current. Under the proposed algorithm, the majority partition would be available even if changes in the network topology take place at a higher rate than the update rate, as long as only simple partitioning takes place.