Add to ORKGHerein, we propose a commit protocol and an associated recovery protocol that is resilient to site failures, lost messages, and network partitioning. The protocols do not require that a failure be correctly identified or even detected. The only potential effect of undetected failures is a degradation in performance. The protocols use a weighted voting scheme that supports an arbitrary degree of data replication (including none) and allows unilaterally aborts by any site. This last property facilitates the integration of these protocols with concurrency control protocols. Both protocols are centralized protocols with low message overhead
This paper proposes an approach for adding fault tolerance, based on consistent checkpointing, to di...
An atomic commit protocol can cause long-term locking of databases if the coordinator crashes or bec...
Distributed applications often use quorums in order to guarantee consistency. With emerging world-wi...
A quorum-based commit and termination protocol is designed with the goal of maintaining high data av...
This paper presents a new atomic commitment protocol that always allows a quorum in the system to ma...
When failures occur during the execution of distributed commit protocols, the protocols may block in...
The implicit yes--vote commit protocol (IYV), proposed for future gigabit--networked distributed dat...
This paper presents a new atomic commitment protocol, enhanced three phase commit (E3PC ), that alw...
In a client-server architecture, replicated copies of an object are assigned to different servers (p...
While traditional fixed-wired network protocols like 2-Phase-Commit guarantee atomicity, we cannot u...
Transactional standards in distributed transactional systems, allows heterogeneous resources to part...
Abstract. This work introduces a highly modular derivation of fast non-blocking atomic commit protoc...
Abstract-A formal model for atomic commit protocols for a distrib-uted database system is introduced...
The distributed transaction commit problem requires reaching agreement on whether a transaction is c...
The distributed transaction commit problem requires reaching agreement on whether a transaction is c...
This paper proposes an approach for adding fault tolerance, based on consistent checkpointing, to di...
An atomic commit protocol can cause long-term locking of databases if the coordinator crashes or bec...
Distributed applications often use quorums in order to guarantee consistency. With emerging world-wi...
A quorum-based commit and termination protocol is designed with the goal of maintaining high data av...
This paper presents a new atomic commitment protocol that always allows a quorum in the system to ma...
When failures occur during the execution of distributed commit protocols, the protocols may block in...
The implicit yes--vote commit protocol (IYV), proposed for future gigabit--networked distributed dat...
This paper presents a new atomic commitment protocol, enhanced three phase commit (E3PC ), that alw...
In a client-server architecture, replicated copies of an object are assigned to different servers (p...
While traditional fixed-wired network protocols like 2-Phase-Commit guarantee atomicity, we cannot u...
Transactional standards in distributed transactional systems, allows heterogeneous resources to part...
Abstract. This work introduces a highly modular derivation of fast non-blocking atomic commit protoc...
Abstract-A formal model for atomic commit protocols for a distrib-uted database system is introduced...
The distributed transaction commit problem requires reaching agreement on whether a transaction is c...
The distributed transaction commit problem requires reaching agreement on whether a transaction is c...
This paper proposes an approach for adding fault tolerance, based on consistent checkpointing, to di...
An atomic commit protocol can cause long-term locking of databases if the coordinator crashes or bec...
Distributed applications often use quorums in order to guarantee consistency. With emerging world-wi...