All-pairs shortest distances maintenance in relational DBMSs

Computing shortest distances is a central task in many graph applications. Although many algorithms to solve this problem have been proposed, they are designed to work in the main memory and/or with static graphs, which limits their applicability to many current applications where graphs are subject to frequent updates. In this paper, we propose novel efficient incremental algorithms for maintaining all-pairs shortest distances in dynamic graphs. We experimentally evaluate our approach on real-world datasets, showing that it outperforms current algorithms designed for the same problem.

[1]  Haixun Wang,et al.  Toward a Distance Oracle for Billion-Node Graphs , 2013, Proc. VLDB Endow..

[2]  Giuseppe F. Italiano,et al.  Finding Paths and Deleting Edges in Directed Acyclic Graphs , 1988, Inf. Process. Lett..

[3]  Kotagiri Ramamohanarao,et al.  Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL , 2005, TODS.

[4]  Ralf Schenkel,et al.  Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs , 2012, CIKM '12.

[5]  James Cheng,et al.  Efficient processing of distance queries in large graphs: a vertex cover approach , 2012, SIGMOD Conference.

[6]  Alexis Papadimitriou,et al.  Edge betweenness centrality: A novel algorithm for QoS-based topology control over wireless sensor networks , 2012, J. Netw. Comput. Appl..

[7]  Rainer Schrader,et al.  Metabolic pathway analysis web service (Pathway Hunter Tool at CUBIC) , 2005, Bioinform..

[8]  Andrea Tagarelli,et al.  Time-aware analysis and ranking of lurkers in social networks , 2015, Social Network Analysis and Mining.

[9]  Hong Cheng,et al.  The exact distance to destination in undirected world , 2012, The VLDB Journal.

[10]  Shuigeng Zhou,et al.  Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation , 2012, Proc. VLDB Endow..

[11]  Andrew V. Goldberg,et al.  Computing Point-to-Point Shortest Paths from External Memory , 2005, ALENEX/ANALCO.

[12]  Hong Cheng,et al.  Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[13]  Mathijs de Weerdt,et al.  Computing All-Pairs Shortest Paths by Leveraging Low Treewidth , 2011, ICAPS.

[14]  Yang Xiang,et al.  A highway-centric labeling approach for answering distance queries on large sparse graphs , 2012, SIGMOD Conference.

[15]  Raymond Chi-Wing Wong,et al.  IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying , 2012, Proc. VLDB Endow..

[16]  Jianzhong Li,et al.  Graph pattern matching , 2010, Proc. VLDB Endow..

[17]  Christian Sommer,et al.  Shortest-path queries in static networks , 2014, ACM Comput. Surv..

[18]  Takuya Akiba,et al.  Fast exact shortest-path distance queries on large networks by pruned landmark labeling , 2013, SIGMOD '13.

[19]  Jeffrey Xu Yu,et al.  Shortest Path Computing in Relational DBMSs , 2014, IEEE Transactions on Knowledge and Data Engineering.

[20]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[21]  Sibo Wang,et al.  Efficient single-source shortest path and distance queries on large graphs , 2013, KDD.

[22]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2003, STOC '03.

[23]  Shuigeng Zhou,et al.  Shortest path and distance queries on road networks: towards bridging theory and practice , 2013, SIGMOD '13.

[24]  Ramesh Hariharan,et al.  Maintaining all-pairs approximate shortest paths under deletion of edges , 2003, SODA '03.

[25]  Sushant S. Khopkar,et al.  Efficient algorithms for incremental all pairs shortest paths, closeness and betweenness in social network analysis , 2014, Social Network Analysis and Mining.

[26]  Igor Jurisica,et al.  Functional topology in a network of protein interactions , 2004, Bioinform..

[27]  Giuseppe F. Italiano,et al.  Experimental analysis of dynamic all pairs shortest path algorithms , 2004, SODA '04.

[28]  Valerie King,et al.  Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).