IS-Label: an independent-set based labeling scheme for point-to-point distance querying

We study the problem of computing shortest path or distance between two query vertices in a graph, which has numerous important applications. Quite a number of indexes have been proposed to answer such distance queries. However, all of these indexes can only process graphs of size barely up to 1 mil...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the VLDB Endowment 2013-04, Vol.6 (6), p.457-468
Main Authors: Fu, Ada Wai-Chee, Wu, Huanhuan, Cheng, James, Wong, Raymond Chi-Wing
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the problem of computing shortest path or distance between two query vertices in a graph, which has numerous important applications. Quite a number of indexes have been proposed to answer such distance queries. However, all of these indexes can only process graphs of size barely up to 1 million vertices, which is rather small in view of many of the fast-growing real-world graphs today such as social networks and Web graphs. We propose an efficient index, which is a novel labeling scheme based on the independent set of a graph. We show that our method can handle graphs of size orders of magnitude larger than existing indexes.
ISSN:2150-8097
2150-8097
DOI:10.14778/2536336.2536346