摘要
针对在线地图服务和路程安排等领域中的点对点最短路径查询方法,提出一种新的数据结构——最短路径B+树(SPB树),以有效存储预先计算好的点空间信息和与之对应的最短路径信息。实验结果证明,利用SPB树在公路网络上进行最短路径查询比经典的Dijkstra算法最高快出3个数量级。
This paper adopts the widely used preprocessing techniques to facilitate shortest path query,and proposes a new index structure,namely Shortest Path B＋ tree（SPB tree）,which can encode both the shortest path information and vertices＇ spatial position compactly.Using this index structure,the point-to-point shortest path query in road network can be answered up to three orders of magnitude faster than using the classical Dijkstra algorithm.Besides,SPB tree is space efficient which occupies reasonable memory consumption and can be constructed efficiently.Extensive experimental studies validates the effectiveness and efficiency of using SPB tree in point-to-point shortest path query.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第22期56-58,63,共4页
Computer Engineering
基金
国家自然科学基金资助项目(60873040)
