• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science and Its Applications(ICCSA 2004) pt.4; 20040514-20040517; Assisi; IT >An Efficient Cache Conscious Multi-dimensional Index Structure
【24h】

An Efficient Cache Conscious Multi-dimensional Index Structure

机译：高效的缓存感知多维索引结构

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

摘要

Recently, to relieve the performance degradation caused by the bottleneck between CPU and main memory, cache conscious multi-dimensional index structures have been proposed. The ultimate goal of them is to reduce the space for entries so as to widen index trees, and minimize the number of cache misses. They can be classified into two approaches according to their space reduction methods. One approach is to compress minimum bounding regions (MBRs) by quantizing coordinate values to the fixed number of bits. The other approach is to store only the sides of MBRs that are different from their parents. In this paper, we investigate the existing multi-dimensional index structures for main memory database systems through experiments under the various work loads. Then, we propose a new index structure that exploits the properties of the both techniques. We implement existing multi-dimensional index structures and the proposed index structure, and perform various experiments to show that our approach outperforms others.
机译：最近，为了缓解由于CPU和主内存之间的瓶颈而导致的性能下降，已经提出了具有缓存意识的多维索引结构。它们的最终目标是减少条目的空间，以扩展索引树，并最大程度地减少高速缓存未命中的次数。根据其空间缩减方法，它们可以分为两种方法。一种方法是通过将坐标值量化为固定位数来压缩最小边界区域（MBR）。另一种方法是仅存储MBR与其父代不同的侧面。在本文中，我们通过在各种工作负荷下进行的实验来研究主内存数据库系统现有的多维索引结构。然后，我们提出了一种新的索引结构，该结构利用了这两种技术的特性。我们实现了现有的多维索引结构和建议的索引结构，并进行了各种实验以表明我们的方法优于其他方法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号