基于TPRA-tree面向预言查询的时空索引  

TPRA-tree:An Improved Spatial-temporal Index for Predictive Queries

作　　者：何茂顺[1] 董一鸿[1] 付世昌[1] 

机构地区：[1]宁波大学计算机科学技术研究所,浙江宁波315211

出　　处：《宁波大学学报（理工版）》2011年第1期34-37,共4页Journal of Ningbo University：Natural Science and Engineering Edition

基　　金：浙江省自然科学基金(Y1080490)

摘　　要：基于TPR-tree典型的移动对象索引方法,提出了TPRA-tree.TPRA-tree从频繁更新的移动对象运动方向的角度进行构造,减少了结点面积,减小了结点间重叠.实验结果表明:TPRA-tree的更新和与查询性能优于TPR-tree.TPR-tree is a typical method of indexing moving objects whose performance continue to deteriorate as the time goes on. In this paper the TPRA-tree is proposed based on the TPR-tree. TPRA-tree, which is derived from the angle of the velocity, is presented for moving objects with frequent updates. It reduces the area and overlap of nodes. The experimental results show that TPRA-tree＇s update and query performance outperform the TPR-tree.

关 键 词：移动对象 TPR—tree TPRA—tree 时空索引 

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