基于Road R-tree的城市路网索引结构研究  

ON INDEX STRUCTURE OF CITY ROAD NETWORK BASED ON ROAD R-TREE

作　　者：王萌[1] 徐立臻[1] 冯钧[2] 

机构地区：[1]东南大学计算机科学与工程学院,江苏南京211189 [2]河海大学计算机与信息工程学院,江苏南京210098

出　　处：《计算机应用与软件》2009年第2期160-162,共3页Computer Applications and Software

摘　　要：在RR-tree(Road R-tree)索引结构下,基于Segment追踪技术的静态道路网里实现两种优化的方法:LSC算法和ASC算法,优化后的道路网,更新频率有一定程度的下降,更新的效率也符合RR-tree索引结构特点,达到了降低道路网中客户端(移动车辆)与服务器端(中心站)更新代价的目的。This paper introduces RR-tree index structure and presents two optimized approaches： LSC algorithm and ASC algorithm, both are realized in static road network based on Segment tracking technique. In optimized road network, the frequency of updating has declined in a certain extent and the efficiency of updating can accord with the characteristic of the RR-tree index structure too. Therefore, the proposed approaches in this paper could achieve the purpose to reduce the cost of updating between the client （ moving vehicles） and server （ center station） in road network.

关 键 词：道路网 RR—tree 路段连接算法 LSC ASC 

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