• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Twenty-Seventh International Conference on Very Large Data Bases, 27th, Sep 11-14th, 2001, Roma, Italy >Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems
【24h】

Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems

机译：共享内存多处理器系统上主内存索引的高速缓存并发控制

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Recent research addressed the importance of optimizing L2 cache utilization in the design of main memory indexes and proposed the so-called cache-conscious indexes such as the CSB+-tree. However, none of these indexes took account of concurrency control, which is crucial for running the real-world main memory database applications involving index updates and taking advantage of the off-the-shelf multiprocessor systems for scaling up the performance of such applications. Observing that latching index nodes for concurrency control (CC) incurs the so-called coherence cache misses on shared-memory multiprocessors thus limiting the scalability of the index performance, this paper presents an optimistic, latch-free index traversal (OLFIT) CC scheme based on a pair of consistent node read and update primitives. An experiment with various index CC implementations for the B+-tree and CSB+-tree shows that the proposed scheme shows the superior scalability on the multiprocessor system as well as the performance comparable to that of the sequential execution without CC on the uniprocessor system.
机译：最近的研究解决了在设计主内存索引时优化L2缓存利用率的重要性，并提出了所谓的“关注缓存的索引”，例如CSB + -tree。但是，这些索引都没有考虑到并发控制，这对于运行涉及索引更新的实际主存数据库应用程序以及利用现成的多处理器系统来扩大此类应用程序的性能至关重要。观察到用于并发控制（CC）的闩锁索引节点会导致共享内存多处理器上的所谓一致性缓存未命中，从而限制了索引性能的可扩展性，本文提出了一种基于乐观，无闩锁的索引遍历（OLFIT）CC方案在一对一致的节点上读取和更新原语。对B +-树和CSB +-树使用各种索引CC实现的实验表明，该方案在多处理器系统上显示了出色的可伸缩性，其性能与单处理器系统上没有CC的顺序执行相当。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号