Skip to main content

A Fast Commit Protocol for Distributed Main Memory Database Systems

  • Conference paper
  • First Online:
Information Networking: Wireless Communications Technologies and Network Applications (ICOIN 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2344))

Included in the following conference series:

Abstract

Although the distributed database systems has been studyed for a long time, there has been only few commercial systems available. The main reason for this is that the distributed commit processing costs too much which results in little or no performance gain compared with single node database system. In this paper, we note the difference in the update and logging policy between disk based database and main memory database in the distributed environment, and presents a fast distributed commit protocol for the main memory database. In the proposed protocol, instead of sending and receiving two sets of messages one after the other as in two phase commit, only one set of messages are sent after the coordinator completes committing a distributed transaction. The main idea of this fast commit processing is to send all the redo-logs to the coordinator so that the coordinator alone can make the decision to commit or abort when the time comes. As a result, the frequency of the communication and the disk access related to the commit processing can be significantly reduced. Our simulation study shows that the proposed commit protocol achieves the high performance as we expect.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. David J. Witt, Randy H. Katz, Prank Olken, Leonard D. Shapiro, Michael R. Stonebraker, and David Wood. Implementation techniques for main memory database systems. SIGMOD Record (ACM Special Interest Group on Management of Data), 14(2):1–8, 1984.

    Google Scholar 

  2. M.J. Franklin, M.J. Zwilling, O.K. Tan, M.J. Carey, and D.J. DeWitt. Crash recovery in client-serverEXODUS. In Proceedings of ACM-SIGMOD International Conference on Management of Data, pages 165–174, June 1992.

    Google Scholar 

  3. A. Citron G. Samaras, K. Britton and C. Mohan. Two-phase commit optimizatins in a commercial distributed environment. Journal of Parallel and Distributed Databases, 3(4), 1995.

    Google Scholar 

  4. H. Garcia-Molina and K. Salem. Main memory database systems: An overview. Trans. on Knowledge and Data Engineering, 4(6):509–516, December 1992.

    Google Scholar 

  5. Ramesh Gupta, Jayant Haritsa, and Krithi Ramamritham. Revisiting commit processing in distributed database systems. In Proceedings of the 1997 ACM SIGMOD, pages 486–497, 1997.

    Google Scholar 

  6. H. V. Jagadish, Avi Silberschatz, and S. Sudarshan. Recovering from main-memory lapses. In International Conference On Very Large Data Bases, pages 391–404, San Francisco, Ca., USA, August 1993. Morgan Kaufmann Publishers, Inc.

    Google Scholar 

  7. Tobin J. Lehman and Michael J. Carey. A recovery algorithm for A high-performance memory-resident database system. In Umeshwar Dayal and Irving L. Traiger, editors, Proceedings of the Association for Computing Machinery Special Interest Group on Management of Data 1987 Annual Conference, pages 104–117, San Francisco, California, 27–29 May 1987.

    Google Scholar 

  8. C. Mohan, B. Lindsay, and R. Obermarck. Transaction management in the r* distributed database management system. ACM Trans. on Database Systems, 11(4), 1986.

    Google Scholar 

  9. C. Mohan and I. Narang. Recovery and coherency-control protocols for fast inter-system page transfer and fine-granularity locking in a shared disks transaction environment. In Proceedings of 17th International Conference on Very Large Databases, pages 193–207, September 1991.

    Google Scholar 

  10. Taesoon Park and Heon Y. Yeom. A consistent group commit protocol for distributed database systems. In Parallel and Distributed Computing Systems, August 1999.

    Google Scholar 

  11. E. Rahm. Recovery concepts for data sharing systems. In Proceedings of the 21st International Conference on Fault-Tolerant Computing (FTCS-21), pages 109–123, June 1991.

    Google Scholar 

  12. Kenneth Salem and Hector Garcia-Molina. System M: A transaction procressing testbed for memory resident data. tkde, 2(1):161–172, March 1990.

    Google Scholar 

  13. H. Schwetman. Csim user’s guide for use with csim revisionl6. In MCC, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, I., Yeom, H.Y. (2002). A Fast Commit Protocol for Distributed Main Memory Database Systems. In: Chong, I. (eds) Information Networking: Wireless Communications Technologies and Network Applications. ICOIN 2002. Lecture Notes in Computer Science, vol 2344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45801-8_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-45801-8_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44255-4

  • Online ISBN: 978-3-540-45801-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics