Skip to main content

Maintaining Cache Coherency for B +  Tree Indexes in a Shared Disks Cluster

  • Conference paper
High Performance Computing for Computational Science - VECPAR 2004 (VECPAR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3402))

Abstract

A shared disks (SD) cluster couples multiple computing nodes for high performance transaction processing, and all nodes share a common database at the disk level. To reduce the number of disk access, the node may cache both data pages and index pages in its local memory buffer. In general, index pages are accessed more often and thus cached at more nodes than their corresponding data pages. Furthermore, tree-based indexes such as B +  trees require complicated operations, e.g., root-to-leaf traversal and structure modification operation due to a page split or a page concatenation. This means that it is strongly required to devise a dedicated cache coherency scheme for index pages that takes advantage of the semantics of their access. In this paper, we propose a new cache coherency scheme for B +  tree indexes in the SD cluster. The proposed scheme can reduce the message traffic between nodes and the number of tree re-traversals. Using a simulation model of the SD cluster, we show that the proposed scheme exhibits substantial performance improvement over the previous schemes.

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. Carey, M., Franklin, M., Zahrioudakis, M.: Adaptive, Fine-Grained Sharing in a Client-Server OODBMS: A Callback-Based Approach. In: ACM Trans. on Database Syst., vol. 22, pp. 570–627 (1997)

    Google Scholar 

  2. Cha, S., Hwang, S., Kim, K., Kwon, K.: Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems. In: Proc. 27th Int. Conf. VLDB, pp. 181–190 (2001)

    Google Scholar 

  3. Cho, H.: Cache Coherency and Concurrency Control in a Multisystem Data Sharing Environment. In: IEICE Trans. Information and Syst. E82-D, 1042–1050 (1999)

    Google Scholar 

  4. Cho, H., Park, J.: Maintaining Cache Coherency in a Multisystem Data Sharing Environment. J. Syst. Architecture 45, 285–303 (1998)

    Article  Google Scholar 

  5. Dan, A., Yu, P.: Performance Analysis of Buffer Coherency Policies in a Multisystem Data Sharing Environment. IEEE Trans. Parallel and Distributed Syst. 4, 289–305 (1993)

    Article  Google Scholar 

  6. DB2 Universal Database for OS/390 and z/OS - Data Sharing: Planning and Administration. IBM SC26-9935-01 (2001)

    Google Scholar 

  7. DeWitt, D., Gray, J.: Parallel Database Systems: The Future of High Performance Database Systems. Comm. ACM 35, 85–98 (1992)

    Article  Google Scholar 

  8. Gottemukkala, V., Omiecinski, E., Ramachandran, U.: Relaxed Index Consistency for a Client-Server Database. In: Proc. 12th Int. Conf. Data Eng., pp. 352–361 (1996)

    Google Scholar 

  9. Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (1993)

    MATH  Google Scholar 

  10. Miyazaki, J., Yokota, H.: Concurrency Control and Performance Evaluation of Parallel B-tree Structures. IEICE Trans. Information and Syst., E85-D, 1269–1283 (2002)

    Google Scholar 

  11. Mohan, C., Haderle, D., Linsay, B., Pirahesh, H., Schwarz, P.: ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging. ACM Trans. on Database Syst. 17, 94–162 (1992)

    Article  Google Scholar 

  12. Mohan, C., Levine, F.: ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. In: Proc. ACM SIGMOD, pp. 371–380 (1992)

    Google Scholar 

  13. Mohan, C., Narang, I.: Recovery and Coherency Control Protocols for Fast Intersystem Page Transfer and Fine-Granularity Locking in a Shared Disks Transaction Environment. In: Proc. 17th Int. Conf. VLDB, pp. 193–207 (1991)

    Google Scholar 

  14. Mohan, C., Narang, I.: Locking and Latching Techniques for Transaction Processing Systems Supporting the Shared Disks Architecture. IBM Research Report (1995)

    Google Scholar 

  15. Oracle Application Server 10g - High Availability. An Oracle White Paper (2004)

    Google Scholar 

  16. Schwetman, H.: User’s Guide of CSIM18 Simulation Engine. Mesquite Software, Inc. (1996)

    Google Scholar 

  17. Vallath, M.: Oracle Real Application Clusters. Elsevier Digital Press, Amsterdam (2004)

    Google Scholar 

  18. Yokota, H., Kanemasa, Y., Miyazaki, J.: Fat-Btrees: An Update-Conscious Parallel Directory Structure. In: Proc. 15th Int. Conf. Data Eng., pp. 448–457 (1999)

    Google Scholar 

  19. Yousif, M.: Shared-Storage Clusters. Cluster Comp. 2, 249–257 (1999)

    Article  Google Scholar 

  20. Zaharioudakis, M., Carey, M.: Highly Concurrent Cache Consistency for Indices in Client-Server Database Systems. In: Proc. ACM SIGMOD, pp. 50–61 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ohn, K., Cho, H. (2005). Maintaining Cache Coherency for B +  Tree Indexes in a Shared Disks Cluster. In: Daydé, M., Dongarra, J., Hernández, V., Palma, J.M.L.M. (eds) High Performance Computing for Computational Science - VECPAR 2004. VECPAR 2004. Lecture Notes in Computer Science, vol 3402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11403937_32

Download citation

  • DOI: https://doi.org/10.1007/11403937_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25424-9

  • Online ISBN: 978-3-540-31854-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics