Maintaining cache coherency for b+ tree indexes in a shared disks cluster

Authors:
Kyungoh Ohn;Haengrae Cho
Affiliations:
Department of Computer Engineering, Yeungnam University, Kyungsan, Kyungbuk, Republic of Korea;Department of Computer Engineering, Yeungnam University, Kyungsan, Kyungbuk, Republic of Korea
Venue:
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
Year:
2004

Citing 14
Cited 0

ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging

ACM Transactions on Database Systems (TODS)
Parallel database systems: the future of high performance database systems

Communications of the ACM
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Highly concurrent cache consistency for indices in client-server database systems

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Adaptive, fine-grained sharing in a client-server OODBMS: a callback-based approach

ACM Transactions on Database Systems (TODS)
Maintaining cache coherency in a multisystem data sharing environment

Journal of Systems Architecture: the EUROMICRO Journal
Transaction Processing: Concepts and Techniques

Transaction Processing: Concepts and Techniques
Shared-storage clusters

Cluster Computing
Performance Analysis of Buffer Coherency Policies in a Multisystem Data Sharing Environment

IEEE Transactions on Parallel and Distributed Systems
Relaxed Index Consistency for a Client-Server Database

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Recovery and Coherency-Control Protocols for Fast Intersystem Page Transfer and Fine-Granularity Locking in a Shared Disks Transaction Environment

VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems

Proceedings of the 27th International Conference on Very Large Data Bases
Fat-Btree: An Update-Conscious Parallel Directory Structure

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Oracle Real Application Clusters

Oracle Real Application Clusters

Quantified Score

Hi-index	0.00

Visualization

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.