首页> 外文期刊>Journal of Parallel and Distributed Computing >Path conscious caching of B~+ tree indexes in a shared disks cluster
【24h】

Path conscious caching of B~+ tree indexes in a shared disks cluster

机译:共享磁盘集群中B〜+树索引的路径感知缓存

获取原文
获取原文并翻译 | 示例

摘要

A shared disks (SD) cluster is a representative architecture to couple multiple computing nodes for high performance transaction processing. Every node in the SD cluster shares a common database at the disk level. To avoid frequent disk accesses, each node caches 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 (SMO) due to a page split or a page concatenation. This means that it is strongly required to devise a dedicated cache coherency scheme (CCS) for index pages that takes advantage of the semantics of their access. In this paper, we propose a new CCS 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. An extensive performance study shows that the proposed scheme exhibits substantial performance improvement over the previous schemes, especially when there are large number of nodes or the update probability is high.
机译:共享磁盘(SD)群集是一种代表性的体系结构,用于耦合多个计算节点以进行高性能事务处理。 SD群集中的每个节点在磁盘级别共享一个公共数据库。为了避免频繁的磁盘访问,每个节点都会在其本地内存缓冲区中同时缓存数据页和索引页。通常,索引页的访问频率更高,因此比其对应的数据页缓存在更多的节点上。此外,由于页面拆分或页面串联,诸如B +树之类的基于树的索引需要复杂的操作,例如,从根到叶的遍历和结构修改操作(SMO)。这意味着强烈需要为索引页设计一种专用的缓存一致性方案(CCS),以利用其访问的语义。在本文中,我们为SD簇中的B〜+树索引提出了一种新的CCS。所提出的方案可以减少节点之间的消息流量和树的遍历次数。广泛的性能研究表明,与以前的方案相比,所提出的方案具有显着的性能改进,尤其是当节点数量很多或更新概率很高时。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号