Parallel Bidirectional Shortest Path Computation in Graphs Using Relational Database Management Systems (RDBMSs)

  • Kwangwon Seo
  • MyeongSeok Kwak
  • Yoonmi Shin
  • Jinhyun AhnEmail author
  • Dong-Hyuk Im
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 536)


Graph data structures are widely used in computer science fields such as biometric information, navigational systems etc. Recently there has been significant research into quickly calculating the shortest path of a graph using the latest databases such as Neo4j, Spark, etc. Alternatively, the Frontier-Expand-Merge operator (FEM) provides a method to find the shortest path using only SQL in RDBMSs. However, the FEM utilizes sequential searching and iterative aggregate functions to find the shortest path. We propose parallel shortest path searching and table indexing as substitution for the aggregate function. To prove the effectiveness of this approach, we compared each method using experimentation and could demonstrate an improvement of up to 80% in processing speed with our proposal.



This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. NRF-2017R1C1B1003600) and Institute for Information & Communications Technology Promotion (IITP) grant funded by the Korea government (MSIP) (No. R0113-15-0005, Development of a Unified Data Engineering Technology for Largescale Transaction Processing and Real-Time Complex Analytics) and Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. NRF-2018R1D1A1B07048380).


  1. 1.
  2. 2.
  3. 3.
    Wagner, D., Willhalm, T.: Speed-up techniques for shortest-path computations. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393. Springer, Berlin (2007)Google Scholar
  4. 4.
    Gao, J., Zhou, J., Yu, J.X., Wang, T.: Shortest path computing in relational DBMSs. IEEE Trans. Knowl. Data Eng. 26(4), 997–1011 (2014)CrossRefGoogle Scholar
  5. 5.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Comer, D.: Ubiquitous B-Tree. ACM Comput. Surv. (CSUR) 11(2), 121–137 (1979)MathSciNetCrossRefGoogle Scholar
  7. 7.
    The 9th DIMACS Implementation Challenge - Shortest Paths.

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • Kwangwon Seo
    • 1
  • MyeongSeok Kwak
    • 1
  • Yoonmi Shin
    • 1
  • Jinhyun Ahn
    • 2
    Email author
  • Dong-Hyuk Im
    • 1
  1. 1.Division of Computer and Information EngineeringHoseo UniversityAsan-siSouth Korea
  2. 2.Department of Management Information SystemsJeju National UniversityJeju-siSouth Korea

Personalised recommendations