Atomicity with incompatible presumptions
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Transaction Processing in a Mobile, Multi-Database Environment
Multimedia Tools and Applications
The Presumed-Either Two-Phase Commit Protocol
IEEE Transactions on Knowledge and Data Engineering
1-2PC: the one-two phase atomic commit protocol
Proceedings of the 2004 ACM symposium on Applied computing
Capturing global transactions from multiple recovery log files in a partitioned database system
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Distributed real time database systems: background and literature review
Distributed and Parallel Databases
Blocking reduction for distributed transaction processing within MANETs
Distributed and Parallel Databases
Two-phase commit processing with restructured commit tree
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Atomic commit protocols, their integration, and their optimisations in distributed database systems
International Journal of Intelligent Information and Database Systems
International Journal of Intelligent Information and Database Systems
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
We argue in favor of the presumed commit protocol by proposing two new presumed commit variants that significantly reduce the cost of logging activities associated with the original presumed commit protocol. Furthermore, for read-only transactions, we apply our unsolicited update-vote optimization and show that the cost associated with this type of transactions is the same in both presumed commit and presumed abort protocols, thus, nullifying the basis for the argument that favors the presumed abort protocol. This is especially important for modern distributed environments which are characterized by high reliability and high probability of transactions being committed rather than aborted.