Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

WSDM

2010

ACM

2010

ACM

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

Added |
01 Mar 2010 |

Updated |
02 Mar 2010 |

Type |
Conference |

Year |
2010 |

Where |
WSDM |

Authors |
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, Rina Panigrahy |

Comments (0)