Welcome to the ADMT Publication Server

Two-Phase Commit Processing with Restructured Commit Tree

DocUID: 2003-015 Full Text: PDF

Author: George Samaras, Geroge K. Kyrou, Panos K. Chrysanthis

Abstract: 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 flattering-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.

Keywords: Atomic Commit Protocols, Commit Optimizations, Distributed Transaction Processing

Published In: : Post Proc. of the 8th Panhellenic Conference on Informatics and Computer Science, LNCS series

ISBN: 3-540-3-540-07544-5

Pages: pp. 82-99

Year Published: 2003

Project: PRO-MOTION Subject Area: Commit Protocols

Publication Type: Conference Paper

Sponsor: NSF IIS-9812532

Citation:Text Latex BibTex XML George Samaras, Geroge K. Kyrou, and Panos K. Chrysanthis. Two-Phase Commit Processing with Restructured Commit Tree, : Post Proc. of the 8th Panhellenic Conference on Informatics and Computer Science, LNCS series (PCI'01), pp. 82-99, 3-540-3-540-07544-5 , May 2003.