Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Optimal termination protocols for network partitioning
SIAM Journal on Computing
Availability in partitioned replicated databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An Information-Based Model for Failure-Handling in Distributed Database Systems
IEEE Transactions on Software Engineering
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Detection of Mutual Inconsistency in Distributed Databases
Proceedings of the Third International Conference on Data Engineering
Transaction Atomicity in the Presence of Network Partitions
Proceedings of the Fourth International Conference on Data Engineering
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
The inherent cost of nonblocking commitment
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Efficient commit protocols for the tree of processes model of distributed transactions
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
| Hi-index | 0.01 |
Network partition is among the hardest failure types in a distributed system even if all processors and links are of fail-stop type. We address the transaction commitment problem in a partitioned distributed database. It is assumed that partitions are detectable. The approach taken is conservative - that is, the same transaction cannot be committed by one site and aborted by another.A new and very general formal model of protocols operating in a partitioned system is introduced and protocols more efficient than the existing ones are constructed.