THE SHORTEST PATH ALGORITHM PERFORMANCE COMPARISON IN GRAPH AND RELATIONAL DATABASE ON A TRANSPORTATION NETWORK

被引：23

作者：

Miler, Mario ^{[1
]}

Medak, Damir ^{[1
]}

Odobasic, Drazen ^{[1
]}

机构：

[1] Univ Zagreb, Fac Geodesy, Zagreb 10000, Croatia

来源：

PROMET-TRAFFIC & TRANSPORTATION | 2014年 / 26卷 / 01期

关键词：

pgRouting; OpenStreetMap; Dijkstra; benchmark; Neo4j; PostgreSQL; BENCHMARK;

D O I：

10.7307/ptt.v26i1.1268

中图分类号：

U [交通运输];

学科分类号：

08 ; 0823 ;

摘要：

In the field of geoinformation and transportation science, the 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 the shortest path. The objective of this research is to compare the 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. Benchmarking was done on commodity hardware using OpenStreetMap road network. The 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.

引用

页码：75 / 82

页数：8

共 50 条

[1] A Comparison of a Graph Database and a Relational Database
Vicknair, Chad
Macias, Michael
Zhao, Zhendong
Nan, Xiaofei
Chen, Yixin
Wilkins, Dawn
PROCEEDINGS OF THE 48TH ANNUAL SOUTHEAST REGIONAL CONFERENCE (ACM SE 10), 2010, : 223 - 228
[2] A new time-dependent shortest path algorithm for multimodal transportation network
Idri, Abdelfattah
Oukarfi, Mariyem
Boulmakoul, Azedine
Zeitouni, Karine
Masri, Ali
8TH INTERNATIONAL CONFERENCE ON AMBIENT SYSTEMS, NETWORKS AND TECHNOLOGIES (ANT-2017) AND THE 7TH INTERNATIONAL CONFERENCE ON SUSTAINABLE ENERGY INFORMATION TECHNOLOGY (SEIT 2017), 2017, 109 : 692 - 697
[3] Transforming Product Catalogue Relational into Graph Database: a Performance Comparison
Lorincz, Josip
Huljic, Vlatka
Begusic, Dinko
2020 43RD INTERNATIONAL CONVENTION ON INFORMATION, COMMUNICATION AND ELECTRONIC TECHNOLOGY (MIPRO 2020), 2020, : 523 - 528
[4] A graph algorithm for the time constrained shortest path
Liu, Pan
Huang, Wulan
CONNECTION SCIENCE, 2022, 34 (01) : 1500 - 1518
[5] SPAGAN: Shortest Path Graph Attention Network
Yang, Yiding
Wang, Xinchao
Song, Mingli
Yuan, Junsong
Tao, Dacheng
PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 4099 - 4105
[6] An Experiment on the Performance of Shortest Path Algorithm
Meng, Simon Chan Yew
Adnan, Nur'ayuni
Sukri, Syazwan Syafiqah
Zainon, Wan Mohd Nazmee Wan
PROCEEDINGS OF KNOWLEDGE MANAGEMENT INTERNATIONAL CONFERENCE (KMICE) 2016, 2016, : 7 - 12
[7] An Algorithm for Extracting Intuitionistic Fuzzy Shortest Path in a Graph
Biswas, Siddhartha Sankar
Alam, Bashir
Doja, M. N.
APPLIED COMPUTATIONAL INTELLIGENCE AND SOFT COMPUTING, 2013, 2013
[8] DMGA: A Distributed Shortest Path Algorithm for Multistage Graph
Cui, Huanqing
Liu, Ruixue
Xu, Shaohua
Zhou, Chuanai
SCIENTIFIC PROGRAMMING, 2021, 2021
[9] THE DYNAMIC PROGRAMMING ALGORITHM AND THE SHORTEST PATH ALGORITHM IN TIME IN SMART TRANSPORTATION
Hu, Haiyuan
Ma, Yunna
INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE & TECHNOLOGY: PROCEEDINGS, 2012, : 87 - 89
[10] The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
Smirnov, A. V.
AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2024, 58 (07) : 745 - 752

← 1 2 3 4 5 →