基于Buddy^＊-Hash的移动对象时空查询方法  

Spatio-temporal Query Method of Moving Object Based on Buddy^＊-Hash

作　　者：刘玥[1] 郝忠孝[1] 

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

出　　处：《计算机工程》2010年第4期47-49,共3页Computer Engineering

基　　金：黑龙江省自然科学基金资助项目(F200601)

摘　　要：索引技术可以提高数据检索和查询效率,为了实现对时空数据库中移动对象的查询操作,需要引入时空索引技术。在传统Buddy-树的基础上提出Buddy*-Hash索引结构,根据扩展查询窗口策略给出范围查询算法。实验结果表明,基于BH索引结构的范围查询算法具有良好性能。Index technique can improve the efficiency of data searching and query. In order to realize query operation of moving object in spatio-temporal database, the spatio-temporal index technique should be introduced. This paper proposes the Buddy^＊-Hash index structure based on Buddy-tree. The range query algorithm is given according to the expansion query window strategy. Experimental results indicate that the range query algorithm based on BH index structure has good performance.

关 键 词：移动对象 索引结构 Hash辅助索引表 范围查询 

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