IndexingofUncertainMovingObjectsforFrequent-计算机科学与探索.PDFVIP

ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@vip. 163.com Journal of Frontiers of Computer Science and Technology 1673-9418/2016/ 10(11)- 1532-14 Tel: +86-10 doi: 10.3778/j.issn. 1673-9418.1510078 面向频繁位置更新的不确定移动对象索引策略* 1+ 1,2 1,2 张 潮 ，李博涵 ，秦小麟 1. 南京航空航天大学 计算机科学与技术学院，南京 210016 2. 软件新技术与产业化协同创新中心，南京 210016 Indexing of Uncertain Moving Objects for Frequent Position Updates ZHANG Chao1+ , LI Bohan1,2 , QIN Xiaolin1,2 1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China 2. Collaborative Innovation Center for Novel Software and Industrialization, Nanjing 210016, China + Corresponding author: E-mail: zhangchao0607@ ZHANG Chao, LI Bohan, QIN Xiaolin. Indexing of uncertain moving objects for frequent position updates. Journal of Frontiers of Computer Science and Technology, 2016, 10(11): 1532-1545. Abstract: Positional uncertainty is one key feature of the moving objects. Existing uncertain moving objects indexing technology aims to improve the efficiency of querying. However, when moving objects positions update frequently, the update cost is huge. In order to solve this cost problem, this paper modifies the group partition strategy of TPU-tree and gives an index structure named GTPU-tree that supports frequent position update. Furthermore, this paper proposes a group partition algorithm STSG based on spatial trajectory of similarity and moving objects group updating algo- rithm. GTPU-tree reduces the number of disk I/O by reducing the update number in the same group, thus decreasing the update cost. This