支持高效路径查询的数据空间索引方法  

Novel dataspace index for efficient processing of path query

作　　者：王念滨[1] 祝官文[1] 周连科[1] 王红卫[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001

出　　处：《吉林大学学报（工学版）》2016年第3期911-916,共6页Journal of Jilin University:Engineering and Technology Edition

基　　金：国家自然科学基金项目(61272185);黑龙江省自然科学基金项目(F201238;F020510);中央高校基本科研业务费专项项目(HEUCFZ1219;HEUCF100608;HEUCF100613)

摘　　要：首先,通过索引连接例子,分析了影响效率的因素。在扩展倒排索引基础上,构建了B-树索引,以支持大规模数据的高效查找。然后,构建了二级索引,以减少索引连接中的大量重复判断。最后,提出了路径查询算法。实验结果表明:该索引方法能够有效地解决索引连接问题和显著地改善数据空间路径查询效率。A novel dataspace index method for efficient processing of path query is proposed.First,an example of joining the extended inverted index was illustrated to find the reason of inefficiency.Then,based on the extended inverted index,a B-tree index was built to efficiently search massive data.Furthermore,a secondary index was constructed in order to significantly reduce the number of repetitive comparisons with respect to index join process.Finally,a path query algorithm was presented based on the proposed dataspace index method.Experimental results show that the proposed method can not only efficiently deal with the problem of index join,but also significantly improve the performance of the path query in the dataspace.

关 键 词：计算机软件 数据空间索引 辅助索引 索引连接 路径查询 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]