Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling

Abstract

We propose a new exact method for shortest-path distance queries on large-scale networks. Our method precomputes distance labels for vertices by performing a breadth-first search from every vertex. Seemingly too obvious and too inefficient at first glance, the key ingredient introduced here is pruning during breadth-first searches. While we can still answer the correct distance for any pair of vertices from the labels, it surprisingly reduces the search space and sizes of labels. Moreover, we show that we can perform 32 or 64 breadth-first searches simultaneously exploiting bitwise operations. We experimentally demonstrate that the combination of these two techniques is efficient and robust on various kinds of large-scale real-world networks. In particular, our method can handle social networks and web graphs with hundreds of millions of edges, which are two orders of magnitude larger than the limits of previous exact methods, with comparable query time to those of previous methods.

To appear in SIGMOD 2013

References in corpus (2)

• Signed Networks in Social Media
• Predicting Positive and Negative Links in Online Social Networks

Cited by in corpus (4)

• Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks
• ReHub. Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale networks
• Cut Tree Construction from Massive Graphs
• Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm