节点文献

基于主存的优化高维索引树

Optimizing High-Dimensional Index Tree for Main Memory Access

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 冯玉才梁俊杰曹忠升

【Author】 Feng Yucai~1,Liang Junjie~(1,2),and Cao Zhongsheng~1 1(College of Computer Science & Technology,Huazhong University of Science and Technology,Wuhan 430074) 2(Faculty of Mathematics & Computer Science,Hubei University,Wuhan 430062)

【机构】 华中科技大学计算机学院湖北大学数学与计算机科学学院

【摘要】 主存多媒体数据库系统性能深受处理器缓存未命中的影响,缓存感知型主存索引是提高数据检索效率的有效手段.针对SA-Tree不适用于主存存取的缺点,提出它的变体CSA-Tree.CSA-Tree利用PCA降维技术,将树的各层节点采用不同的维度来表示,这样不仅提高缓存空间的利用率,还降低了CPU负载,从而提高了索引查询效率.大量实验证明,CSA-Tree在主存环境中具有良好的高维数据检索性能.

【Abstract】 In main-memory databases,the number of processor cache misses has a critical impact on the performance of the system.Cache-conscious indices are designed to improve performance by reducing the processor cache misses that are incurred during a search operation.Considering the disadvantage of SA-Tree inefficient for main memory access,its variant called CSA-Tree is presented,which is a multi-level structure where each level of the tree represents the data space at different dimensionalities by using principal component analysis.Each level of the tree serves to prune the search space more efficiently as the reduced dimensions can better exploit the small cache line size.Moreover,the distance computation on lower dimensionality is less expensive.Extensive experiments are conducted to evaluate the proposed structures against other methods.The results show that the CSA-Tree is superior in most cases.

  • 【会议录名称】 第二十三届中国数据库学术会议论文集(研究报告篇)
  • 【会议名称】第二十三届中国数据库学术会议
  • 【会议时间】2006-11-10
  • 【会议地点】中国广东广州
  • 【分类号】TP311.13
  • 【主办单位】中国计算机学会数据库专业委员会
节点文献中: 

本文链接的文献网络图示:

本文的引文网络