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 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.
This work was supported in part by the European IST project DBGlobe, IST-2001- 32645.
This work was supported in part by the National Science Foundation under grant IIS-9812532.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al-Houmaily Y. J. and Chrysanthis P.K.: “An Atomic Commit Protocol for Gigabit-Networked Distributed Database Systems”, The Journal of Systems Architecture, Vol.46, No.9, pp.809–833, 2000. 83, 87
Al-Houmaily Y. J. and Chrysanthis P.K.: “Atomicity with Incompatible Presumptions”, Proceedings 8th ACM PODS Symposium, pp.306–315, 1999.
Al-Houmaily Y. J., Chrysanthis P.K. and Levitan S.P.: “Enhancing the Performance of Presumed Commit Protocol”, Proceedings 12th ACM SAC Symposium, pp.131–133, 1997. 96
Al-Houmaily Y. J., Chrysanthis P.K. and Levitan S.P.: “An Argument in Favor of Presumed Commit Protocol”, Proceedings 13th IEEE ICDE Conference, pp.255–265, 1997. 83, 96
Al-Houmaily Y. J. and Chrysanthis P.K.: “Dealing with Incompatible Presumptions of Commit Protocols in Multidatabase Systems”, Proceedings 11th ACM SAC Symposium, pp.186–195, 1996. 83
Chrysanthis P.K., Samaras G. and Al-Houmaily Y. J.: “Recovery and Performance of Atomic Commit Protocols in Distributed Database Systems”, In Recovery in Database Management Systems, V. Kumar and M. Hsu (eds.), pp.370–416, Prentice Hall, 1998. 83
Gray J.N.: “Notes on Data Base Operating Systems”, In Operating Systems-an Advanced Course, R. Bayer, R. Graham, and G. Seegmuller (eds.), LNCS, Vol.60, Springer-Verlag, 1978. 83, 87
Gray J.N. and Reuter A.: Transaction Processing: Concepts and Techniques. Morgan Kaufman, 1993. 82, 84
IBM Database System DB2, Version 3, Document Number SC30-3084-5, IBM, 1994. 94
IBM Systems Network Architecture. SYNC Point Services Architecture Reference, Document Number SC31-8134, 1994. 83
Kyrou G. and Samaras G.: “A Graphical Simulator of Distributed Commit Protocols”, Internet Site: http://ada.cs.ucy.ac.cy/∼cssamara/ 85
Liu M., Agrawal D. and El Abbadi A.: “The Performance of Two-Phase Commit Protocols in the Presence of Site Failures”, Proceedings 24th Symposium on Fault-Tolerant Computing, 1994. 85
Lampson B. and Lomet D.: “A New Presumed Commit Optimization for Two Phase Commit”, Proceedings 19th VLDB Conference, pp.630–640, 1993. 83
Lampson B.W.: “Atomic Transactions”, In Distributed Systems: Architecture and Implementation-an Advanced Course, B.W. Lampson (ed.), LNCS, Vol.105, Springer-Verlag, pp.246–265, 1981. 83, 87
Mohan C., Britton K., Citron A. and Samaras G.: “Generalized Presumed Abort: Marrying Presumed Abort and SNA’s LU6.2 Commit Protocols”, Proceedings Workshop on Advance Transaction Models and Architectures (ATMA96), 1996. 83
Mohan C., Lindsay B. and Obermarck R.: “Transaction Management in the R* Distributed Data Base Management System”, ACM Transactions on Database Systems, Vol.11, No.4, pp.378–396, 1986. 83, 89
Information Technology-Open Systems Interconnection-Distributed Transaction Processing-Part 1: OSI TP Model; Part 2: OSI TP Service, ISO/IEC JTC 1/SC 21 N, 1992. 89
Gupta R., Haritsa J. and Ramamritham K.: “Revisiting Commit Processing in Distributed Database Systems”, Proceedings ACM SIGMOD Conference, pp.486–497, 1997. 85
Raz Y.: “The Dynamic Two-Phase Commitment Protocol”, Proceedings 5th Conference on Information Systems and Data Management, 1995. 83
Samaras G., Britton K., Citron A. and Mohan C.:“Commit Processing Optimizations in the Commercial Distributed Environment”, Distributed and Parallel Databases Journal, Vol.3, No.4, pp.325–361, 1995. 83, 91
Samaras G., Britton K., Citron A. and Mohan C.: “Enhancing SNA’s LU6.2 Sync Point to Include Presumed Abort Protocol”, IBM Technical Report TR29.1751, IBM Research Triangle Park, 1993. 83
Spiro P., Joshi A., Rengarajan T.K.: “Designing an Optimized Transaction Commit Protocol”, Digital Technical Journal, Vol.3, No.1, Winter 1991. 83
Stamos J.W. and Cristian F.: “A Low-Cost Atomic Commit Protocol”, Proceedings 9th Symposium on Reliable Distributed Systems, pp.66–75, 1990. 87
Stamos J.W. and Cristian F.: “Coordinator Log Transaction Execution Protocol”, Distributed and Parallel Databases Journal, Vol.1, No.4, pp.383–408, 1993. 83, 87
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Samaras, G., Kyrou, G.K., Chrysanthis, P.K. (2003). Two-Phase Commit Processing with Restructured Commit Tree. In: Manolopoulos, Y., Evripidou, S., Kakas, A.C. (eds) Advances in Informatics. PCI 2001. Lecture Notes in Computer Science, vol 2563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38076-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-38076-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07544-8
Online ISBN: 978-3-540-38076-4
eBook Packages: Springer Book Archive