一种适合于频繁位置更新的网络受限移动对象轨迹索引_丁治明.pdfVIP

35 　7 　　　　　　　　 Vol.35 No.7 20 12 7 CHIN ESE JOU RNA L OF COM PUTE RS July 2012 　 丁治明 (　　100190) 　　.S T R-Tree、 T B-Tree、FNR-Tree、MON-Tree , , ., R (DST R-Tree).DST R-Tree , , R . , , , ., DS T R-T ree , . 　;;;; TP 309 　　　DOI :10.3724/SP.J.10 16.2012.0 1448 An Index Structure for Frequently Updated Network-Constrained Moving O ject Trajectories DING Zhi-Ming (National Fundamental S of tware Research Center, Institute of S of tware, Chinese Academy of S ciences, Beij ing 　100190) A stract　Index is key technology to improve the query processing perform nce of moving ob- jects d t b ses.How ever, current index methods for moving object tr jectories, such s STR- T ree, TB -T ree, FNR-T ree, nd MON-T ree, t ke tr jectory units s the b sic index records, nd therefore, frequent insertions re needed w hen loc tion upd tes occur in order to keep the consistency betw een the index nd the tr jectories in d t b se, w hich gre tly ffects the over ll perform nce of moving objects d t b ses.To solve this problem, w e propose new index meth- od, Dyn mic S ketched-Tr jectory R-Tree for Netw ork-constr ined Moving Objects (DSTR-Tree) in this p per.The DSTR-T ree divides the sp ti l-tempor l sp ce into equ l-sized grid cells, tr nsform s every tr jectory into sketched tr jectory with e ch unit connecting tw o center s of the grid cells th t the moving object tr vels through, nd indices the sketched tr jectory units s n R-Tree.Since the sketched tr jectory h s much co rser gr nul rity th n the origin l tr jectory, the index upd ting cost c n be gre tly reduced-w hen loc tion upd te