###
DOI:
Journal of Software:2008.19(10):2696-2705

基于U-tree的不确定移动对象索引策略
丁晓锋,卢炎生,潘鹏,洪亮,魏琼
(华中科技大学 计算机科学与技术学院,湖北 武汉 430074)
U-Tree Based Indexing Method for Uncertain Moving Objects
DING Xiao-Feng,LU Yan-Sheng,PAN Peng,HONG Liang,WEI Qiong
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3622   Download 3885
Received:July 30, 2007    Revised:February 25, 2008
> 中文摘要: 通过在U-tree中添加时间戳和速度矢量等时空因素,提出一种基于U-tree的高效率当前及未来不确定位置信息检索的索引结构TPU-tree,可以支持多维空间中不确定移动对象的索引,并提出了一种改进的基于p-bound的MP_BBRQ(modified p-bound based range query)域查询处理算法,能够引入搜索区域进行预裁剪以减少查询精炼阶段所需代价偏高的积分计算.实验仿真表明,采用MP_BBRQ算法的TPU-tree概率查询性能极大地优于传统的TPR-tree索引,且更新性能与传统索引大致相当,具有良好的实用价值.
Abstract: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.
文章编号:     中图分类号:    文献标志码:
基金项目:Supported by the Pre-Research Project of the 'Eleventh Five-Year-Plan' of China under Grant No.513150402 (国家'十一五'预研基金) Supported by the Pre-Research Project of the 'Eleventh Five-Year-Plan' of China under Grant No.513150402 (国家'十一五'预研基金)
Foundation items:
Reference text:

丁晓锋,卢炎生,潘 鹏,洪 亮,魏 琼.基于U-tree的不确定移动对象索引策略.软件学报,2008,19(10):2696-2705

DING Xiao-Feng,LU Yan-Sheng,PAN Peng,HONG Liang,WEI Qiong.U-Tree Based Indexing Method for Uncertain Moving Objects.Journal of Software,2008,19(10):2696-2705