Modified MinG algorithm to find top-K shortest paths from large RDF graphs

Abstract

MinG algorithm indexes large RDF graphs in an efficient way and then uses the index to answer all path queries between two nodes of the graph. MinG reduces the computational and space complexity of indexing by not creating a special type of adjacency matrix called Path Type Matrix at each level of indexing. We only need Path Type Matrices at first and last level of indexing. MinG was modified to answer top-K shortest paths. The experiments were performed on specific case studies. Gain in the performance is significant due to reduction in the space to index a graph and also reduction in computation time to answer path queries.