一种基于B^X树的移动对象混合索引方法  

Hybrid indexing of moving objects based on B^X-tree

作　　者：张辉[1] 刘永山[1] 高云[1] 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《计算机应用》2010年第1期22-24,28,共4页journal of Computer Applications

基　　金：河北省自然科学基金资助项目(F2009000473)

摘　　要：为实现移动对象当前及未来位置索引,提出了一种自适应SABX树,考虑到移动对象在现实世界中分布密度不同的特点,利用时间划分和空间填充曲线技术计算移动对象位置信息,并引进了一个以秩的范围为标识的Hash辅助索引表,给出了SABX树的插入、删除、更新方法以及范围查询算法。实验表明,该索引结构的动态更新性能和查询效率优于BX树和传统的TPR树。A Self-Adaptive Bx-tree （ SABx） was presented for indexing the current and future position of moving objects. Taking account of the different density of moving objects in reality, SABx-tree utilized the technology of temporal partitioning and space-filling curves to calculate the objects＇ position, then a supplemented Hash index was introduced to store and index the forest of BX-trees. Besides, the insertion, deletion, update methods and range query algorithm were developed for SABx- tree. Experimental results show that SABX-tree＇ s dynamic update and query performances outperform those of BX-tree and traditional TPR-tree.

关 键 词：移动对象索引 BX树 HILBERT曲线 秩 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]