基于U-tree的不确定移动对象索引策略  

U-Tree Based Indexing Method for Uncertain Moving Objects

作　　者：丁晓锋[1] 卢炎生[1] 潘鹏[1] 洪亮[1] 魏琼[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《软件学报》2008年第10期2696-2705,共10页Journal of Software

基　　金：国家‘十一五'预研基金~~

摘　　要：通过在U-tree中添加时间戳和速度矢量等时空因素,提出一种基于U-tree的高效率当前及未来不确定位置信息检索的索引结构TPU-tree,可以支持多维空间中不确定移动对象的索引,并提出了一种改进的基于p-bound的MP_BBRQ(modifiedp-bound based range query)域查询处理算法,能够引入搜索区域进行预裁剪以减少查询精炼阶段所需代价偏高的积分计算.实验仿真表明,采用MP_BBRQ算法的TPU-tree概率查询性能极大地优于传统的TPR-tree索引,且更新性能与传统索引大致相当,具有良好的实用价值.This paper proposes a novel, U-tree based indexing technique that addresses the problem of managing uncertain data in a constantly evolving environment. The technique called TPU-tree is capable of indexing the moving objects with uncertainty in multi-dimensional spaces. Along with the data models capturing the temporal and spatial uncertainty, a modified p-bound based range query （MP_BBRQ） algorithms for probabilistic queries is also developed. Experimental evaluations demonstrate that the TPU-tree supports queries on uncertain moving objects quite efficiently. It yields rather good update performance even under frequent update environments, and has a practical value.

关 键 词：移动对象位置管理 索引结构 不确定性数据 TPU树 MP_BBRQ(modified p-bound based range query)算法 

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