A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Introduction to a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
A locking protocol for resource coordination in distributed databases
ACM Transactions on Database Systems (TODS)
Reliability mechanisms for SDD-1: a system for distributed databases
ACM Transactions on Database Systems (TODS)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
The two-step commitment protocol: Modeling, specification and proof methodology
ICSE '81 Proceedings of the 5th international conference on Software 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
An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
Optimal termination protocols for network partitioning
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
The failure and recovery problem for replicated databases
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
An n-failure-resilient protocol for distributed transaction processing regarding site crash, network partitioning, and local failures like abort of subtransactions is specified. The three-phased protocol contains concurrency control, a mechanism enforcing mutual consistency, and commitment based on majority consensus w.r.t. multiple copies of entities. To cope with transaction manager failures, backup processes for the manager are used. Data redundancy given by multiple copies in a partially redundant database is utilized to improve the resiliency of the protocol, i.e. to improve especially the successful commitment of update transactions processed by the protocol. The protocol is n-failure-resilient if the least redundant entity to be accessed by a transaction is mapped onto at least 2n+1 file copies in the distributed database.