Sciweavers

Share
CIKM
2010
Springer

Fast and accurate estimation of shortest paths in large graphs

8 years 10 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a number of techniques exist for answering reachability queries and approximating node distances efficiently, determining actual shortest paths (i. e. the sequence of nodes involved) is often neglected. However, in applications arising in massive online social networks, biological networks, and knowledge graphs it is often essential to find out many, if not all, shortest paths between two given nodes. In this paper, we address this problem and present a scalable sketch-based index structure that not only supports estimation of node distances, but also computes corresponding shortest paths themselves. Generating the actual path information allows for further improvements to the estimation accuracy of distances (and paths), leading to near-exact shortest-path approximations in real world graphs. We evaluate our techn...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu
Added 24 Jan 2011
Updated 24 Jan 2011
Type Journal
Year 2010
Where CIKM
Authors Andrey Gubichev, Srikanta J. Bedathur, Stephan Seufert, Gerhard Weikum
Comments (0)
books