道路网络中移动对象的索引研究  

Research on indexing of moving objects in road networks

作　　者：宋广军[1,2] 郝忠孝[1,3] 王丽杰[2] 

机构地区：[1]哈尔滨理工大学计算机与控制学院,哈尔滨150080 [2]齐齐哈尔大学计算机与控制工程学院,黑龙江齐齐哈尔161006 [3]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001

出　　处：《计算机工程与应用》2010年第22期157-161,共5页Computer Engineering and Applications

基　　金：黑龙江省自然科学基金No.F2000601~~

摘　　要：为了能有效地实现网络中移动对象的过去、当前和将来轨迹的查询,提出了一种L2R索引,它由两层R树和一个链表结构组成。两层R树用以索引道路网络和移动对象过去的运动,对象当前的位置和将来的预测轨迹信息保存在链表中。L2R索引不仅可以支持网络中的移动对象的轨迹查询,尤其是可方便的在纵向链表中查询在同条路线上的所有对象。在此索引基础上文中实施了对移动对象的范围查询和点查询,最后通过实验表明L2R结构的索引和查询性能均要优越于TPR树。This paper proposes a new index structure to efficiently store and retrieve the past,present and future positions of moving objects in networks, L2R-Tree.The index structure consistes of two-level 2D R-tree and a linklist.The two-level R-trees are used to index polyline and objects＇ movements along the polylines.The present positions and future prediction tra- jectories of moving objects are stored in linklist.L2R-Tree road networks but also is especially easy to query all the can not only support the trajectories query of moving objects in moving objects in the same route by lengthways list.Moreover, point query and range query are implemented based on this index structure.Finally, experimental studies indicate that the L2R-tree index outperformed TPR-tree in index creation as well as in querying.

关 键 词：移动对象数据库 范围查询 L2R树 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]