Transaction management in the R* distributed database management system
ACM Transactions on Database Systems (TODS)
Coordinator log transaction execution protocol
Distributed and Parallel Databases
Two-phase commit optimizations in a commercial distributed environment
Distributed and Parallel Databases
Revisiting commit processing in distributed database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Atomicity with incompatible presumptions
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dealing with incompatible presumptions of commit protocols in multidatabase systems
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Enhancing the performance of presumed commit protocol
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
An atomic commit protocol for gigabit-networked distributed database systems
Journal of Systems Architecture: the EUROMICRO Journal
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
An Argument in Favour of Presumed Commit Protocol
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
A New Presumed Commit Optimization for Two Phase Commit
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Distributed Systems - Architecture and Implementation, An Advanced Course
1-2PC: the one-two phase atomic commit protocol
Proceedings of the 2004 ACM symposium on Applied computing
Atomic commit protocols, their integration, and their optimisations in distributed database systems
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
Extensive research has been carried out in search for an efficient atomic commit protocol and many optimizations have been suggested to improve the basic two-phase commit protocol, either for the normal or failure case. Of these optimizations, the read-only optimization is the best known and most widely used, whereas the flattening of-the-commit-tree optimization is the most recent one proposed for Internet transactions. In this paper, we study in depth the combined use of these two optimizations and show the limitations of the flattening-of-the-commit-tree method in committing large trees. Further, we propose a new restructuring method of the commit tree and show using simulation that it performs better than flattening method even when dealing with large trees.