摘要： 地理信息系统中的空间网络分析有最短路径分析、资源分配分析、等时性分析等等,而最短路径分析是其中关键的环节,因而对其算法进行优化很有必要,为此在传统的最短路径算法,即Dikstra算法的基础上,采用关系数据库的存储机制,实现对最短路径查询,不但降低了系统的开销,而且较好地解决空间数据访问的并发控制问题和数据安全性问题。通过具体案例分析表明,该方法是有效可行的。

关键词: Dijkstra算法, 最短路径, 数据库中间件, 地理信息系统

Abstract: In GIS, it is necessary to optimize the analysis function of the shortest path as the hinge of spatial network analysis, which includes shortest path analysis, resource allocation and isochrone, and so on. Here derived from the traditional calculating method, ie. Dijkstra algorithm, the query about shortest path is based on relationship database. This technique not only solves the problem of spatial data sharing but also improve the efficiency of computer system.

中图分类号: 

• P208