A Sketch-Based Distance Oracle for Web-Scale Graphs

We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance queries between pairs of nodes in real time. Since the standard shortest path algorithms are expensive, our approach moves the time-consuming shortest-path computation offline, and at query time only looks up precomputed values and performs simple and fast computations on these precomputed values. More specifically, during the offline phase we compute and store a small "sketch" for each node in the graph, and at query-time we look up the sketches of the source and destination nodes and perform a simple computation using these two sketches to estimate the distance. Categories and Subject Descriptors G.2.2 [Graph Theory]: Graph algorithms, path and circuit problems General Terms Algorithm, Performance Keywords Algorithms, Sketching, Embedding, Distance Computation, Shortest Path

• Type: Conference
• Year: 2010
• Where: WSDM
• Authors: Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
• Keywords: Data Mining, Precomputed Values, Shortest Path Algorithms, Shortest-path Computation Offline, WSDM 2010