A Sketch-Based Distance Oracle for Web-Scale Graphs

A Sketch-Based Distance Oracle for Web-Scale Graphs

Cached

Download Links

by Atish Das Sarma , Sreenivas Gollapudi , Rina Panigrahy , Marc Najork

Citations:

6 - 1 self

Versions

Version 0

Version History

Metadata Version 0

Datum	Value	Source
TITLE	A Sketch-Based Distance Oracle for Web-Scale Graphs	SVM HeaderParse 0.2
AUTHOR NAME	Atish Das Sarma	SVM HeaderParse 0.2
AUTHOR AFFIL	Georgia Institute of; Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Atlanta, GA, USA	SVM HeaderParse 0.2
AUTHOR NAME	Sreenivas Gollapudi	SVM HeaderParse 0.2
AUTHOR AFFIL	Microsoft Research	SVM HeaderParse 0.2
AUTHOR ADDR	Mountain View, CA, USA	SVM HeaderParse 0.2
AUTHOR NAME	Rina Panigrahy	SVM HeaderParse 0.2
AUTHOR AFFIL	Microsoft Research	SVM HeaderParse 0.2
AUTHOR ADDR	Mountain View, CA, USA	SVM HeaderParse 0.2
AUTHOR NAME	Marc Najork	SVM HeaderParse 0.2
AUTHOR AFFIL	Microsoft Research	SVM HeaderParse 0.2
AUTHOR ADDR	Mountain View, CA, USA	SVM HeaderParse 0.2
ABSTRACT	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	SVM HeaderParse 0.2
CITATIONS	20 found	ParsCit 1.0