基于U-tree的不确定移动对象索引策略-软件学报.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.19, No.10, October 2008, pp.2696−2705 DOI: 10.3724/SP.J.1001.2008.02696 Tel/Fax: +86-10 © 2008 by Journal of Software . All rights reserved. ∗ 基于 U-tree 的不确定移动对象索引策略 + 丁晓锋 , 卢炎生, 潘 鹏, 洪 亮, 魏 琼 (华中科技大学 计算机科学与技术学院,湖北 武汉 430074) U-Tree Based Indexing Method for Uncertain Moving Objects + DING Xiao-Feng , LU Yan-Sheng, PAN Peng, HONG Liang, WEI Qiong (College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China) + Corresponding author: E-mail: dxf@ Ding XF, Lu YS, Pan P, Hong L, Wei Q. U-tree based indexing method for uncertain moving objects. Journal of Software, 2008,19(10):2696−2705. /1000-9825/19/2696.htm 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. Key words: location management for moving objects; index structure; data uncertainty; TPU-tree; MP_BBRQ (modified p -bound