Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Optimal termination protocols for network partitioning
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
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
A Quorum-Based Commit Protocol
A Quorum-Based Commit Protocol
Merging Partitioned Databases
Increasing Availability in Partitioned Database Systems
Increasing Availability in Partitioned Database Systems
An optimistic protocol for partitioned distributed database systems
An optimistic protocol for partitioned distributed database systems
Managing distributed databases in partitioned networks
Managing distributed databases in partitioned networks
| Hi-index | 0.00 |
Partition failure causes a major problem for the availability of a distributed database system. No protocol can consistently terminate all parts of a distributed transaction under all possible partitions, since some sites executing subtransactions may not know that other sites have already committed (or aborted) and, therefore, must wait until the failure is repaired. Under a site optimal termination protocol, the expected number of waiting sites is minimized, hence it maximizes the "availability" of a database system in the presence of partition failures. We introduce a new class of partition failures. We introduce a new class of termination protocols, called size-based termination protocols, and identify site optimal termination protocols within this class.