Relational Approach for Shortest Path Discovery over Large Graphs

Jun Gao, Ruoming Jin, Jiashuai Zhou +3

With the rapid growth of large graphs, we cannot assume that graphs can still be fully loaded into memory, thus the disk-based graph operation is inevitable. In this paper, we take…