首页 | 官方网站   微博 | 高级检索  
     

CSA-Tree:一种改进的高维主存索引树
引用本文:梁俊杰,冯玉才.CSA-Tree:一种改进的高维主存索引树[J].计算机学报,2007,30(3):415-423.
作者姓名:梁俊杰  冯玉才
作者单位:1. 华中科技大学计算机学院,武汉,430074;湖北大学数学与计算机科学学院,武汉,430062
2. 华中科技大学计算机学院,武汉,430074
基金项目:国家高技术研究计划发展专项经费
摘    要:主存技术的不断进步,使得主存多媒体数据库的实现成为可能.研究表明,主存多媒体数据库系统性能深受处理器缓存未命中的影响,缓存感知型主存索引是提高数据检索效率的有效手段.针对SA-Tree不适用于主存存取的缺点,提出它的变体CSA-Tree.CSA-Tree利用PCA降维技术,将树的各层节点采用不同的维度表示,这样不仅提高了缓存空间的利用率,还降低了CPU负载,从而提高了索引查询效率.大量实验证明,CSA-Tree在主存环境中具有良好的高维数据检索性能.

关 键 词:高维主存索引  L2-cache未命中  距离计算  KNN查询  主成分分析  改进  主存  索引树  Access  Main  Memory  Tree  检索性能  高维数据  环境  验证  查询效率  负载  利用率  空间  维度表  节点  降维技术  变体  手段  检索效率
修稿时间:2005-02-192006-09-15

CSA-Tree:An Optimized High-Dimensional Index Tree for Main Memory Access
LIANG Jun-Jie,FENG Yu-Cai.CSA-Tree:An Optimized High-Dimensional Index Tree for Main Memory Access[J].Chinese Journal of Computers,2007,30(3):415-423.
Authors:LIANG Jun-Jie  FENG Yu-Cai
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 number of processor cache misses that are incurred during a search operation.Considering the disadvantage of SA-Tree inefficient for main memory access,the authors present its variant called CSA-Tree,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 show that the CSA-Tree is superior in most cases compared with other methods.
Keywords:high-dimensional main memory index  L2-cache misses  distance computation  K-Nearest Neighbor queries  principal component analysis
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号