Computing source-to-target shortest paths for complex networks in RDBMS
作者：
Highlights：
• We use relational database management systems (RDBMS) for solving shortest paths on large networks.
• Our algorithms outperform counterparts running on modern native graph databases.
• Our algorithms perform orders of magnitude faster than baselines and even faster than main memory algorithms for large graphs.
摘要
•We use relational database management systems (RDBMS) for solving shortest paths on large networks.•Our algorithms outperform counterparts running on modern native graph databases.•Our algorithms perform orders of magnitude faster than baselines and even faster than main memory algorithms for large graphs.
论文关键词：Big graphs,Relational databases,SQL,Shortest paths algorithms
论文评审过程：Received 18 March 2016, Revised 1 September 2016, Accepted 25 September 2016, Available online 11 October 2016, Version of Record 7 August 2017.
论文官网地址：https://doi.org/10.1016/j.jcss.2016.09.011
