A shortest path algorithm performance comparison in graph and relational database on a transportation network

In the field of geoinformation and transportation science, shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of shortest path. The objective of this research is to compare performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting) and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmark was done on commodity hardware using OpenStreetMap road network. First assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.


  • English

Media Info

  • Media Type: Print
  • Features: Figures; References;
  • Pagination: pp 75-82
  • Serial:
  • Publication flags:

    Open Access (libre)

Subject/Index Terms

Filing Info

  • Accession Number: 01523145
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Apr 2 2014 8:46PM