摘要
为实现移动对象当前及未来位置索引,提出了一种自适应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.
出处
《计算机应用》
CSCD
北大核心
2010年第1期22-24,28,共4页
journal of Computer Applications
基金
河北省自然科学基金资助项目(F2009000473)
