Optimization of Shortest-Path Search on RDBMS-Based Graphs

Abstract

Calculation of the shortest path between two nodes in a graph is a popular operation used in graph queries in applications such as map information systems, social networking services, and biotechnology. Recent shortest-path search techniques based on graphs stored in relational databases are able to calculate the shortest path efficiently, even in large data using frontier-expand-merge operations. However, previous approaches used a sequential bidirectional search method that causes a bottleneck, thus degrading performance. The repeated use of an aggregate SQL function also degrades performance. This paper proposes a parallel bi-directional search method using multithreading. In addition, an efficient optimization method is proposed that uses B-tree indexing instead of an aggregate SQL function. Various experiments using synthetic and real data reveal that the proposed optimization technique performs more efficiently than conventional methods. As the size of data in practical applications continues to grow, these optimizations will enable the shortest path in a graph to be found quickly and accurately.

An Improved Retrieval Method for Multi-Transaction Mode Consortium Blockchain

“…One of the most important application scenarios of Redis is as business cache, which is used to keep some hot data that are not frequently changed but frequently accessed in memory [19], effectively reducing the number of database reads, reducing database pressure, improving response time, and enhancing throughput. Redis also provides the compressed lists as a data structure to store a series of data and its encoding information in a continuous memory area.…”

Architecture Design and Code Implementation of Road Network Path Search System

“…The road network path search system is one of the core functions of various systems such as GIS, GPS, logistics robots, unmanned aerial vehicles, and autonomous vehicles [1]. The shortest path search algorithm includes Dijkstra algorithm, A * algorithm, SPFA algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm, and Johnson algorithm.…”

Storage and Navigation Operations on Graphs in Relational DBMS

“…GRFusion (HASSAN et al, 2017;HASSAN et al, 2018b;HASSAN et al, 2018a) and Db2 Graph (TIAN et al, 2019;TIAN et al, 2020) create graph views to materialize paths using customized commands and executes queries over these paths. Regarding recursive query optimizations, there are approaches for reducing its intermediary size's results (ORDONEZ, 2005); partitioning methods for the edge table (GAO et al, 2014;HONG et al, 2017;SEO;AHN;IM, 2019); specialized data representations based on adjacency lists (SUN et al, 2015;CHEN, 2013;AHMED;THOMO, 2017); in-memory graph process engines (MA et al, 2016;ZHAO et al, 2019); relational matrix algebra adaptations (DOLMATOVA; AUGSTEN; BÖHLEN, YU, 2017). The relevance of recursive queries as a field of study can be seen through several research articles (ORDONEZ; CABRERA; GURRAM, 2017;JINDAL et al, 2015;RAJ;PATEL, 2015;SIMMEN et al, 2014;PASSING et al, 2017;FLORATOS et al, 2018;ORDONEZ, 2017).…”