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

Authors:
Ada Wai-Chee Fu;Huanhuan Wu;James Cheng;Raymond Chi-Wing Wong
Affiliations:
Dept. of Computer Science and Engineering, The Chinese University of Hong Kong;Dept. of Computer Science and Engineering, The Chinese University of Hong Kong;Dept. of Computer Science and Engineering, The Chinese University of Hong Kong;Dept. of Computer Science and Engineering, Hong Kong University of Science & Technology
Venue:
Proceedings of the VLDB Endowment
Year:
2013

Citing 33
Cited 2

The input/output complexity of sorting and related problems

Communications of the ACM
I/O-complexity of graph algorithms

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On external memory graph traversal

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
External-Memory Breadth-First Search with Sublinear I/O

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory

SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Reachability and Distance Queries via 2-Hop Labels

SIAM Journal on Computing
Approximate distance oracles

Journal of the ACM (JACM)
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A computational study of external-memory BFS algorithms

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximate distance oracles for unweighted graphs in expected O(n2) time

ACM Transactions on Algorithms (TALG)
I/O-efficient undirected shortest paths with unbounded edge lengths

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Scalable network distance browsing in spatial databases

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Engineering multilevel overlay graphs for shortest-path queries

Journal of Experimental Algorithmics (JEA)
On-line exact shortest distance query processing

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficiently indexing shortest paths by exploiting symmetry in graphs

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Via Detours to I/O-Efficient Shortest Paths

Efficient Algorithms
Fast shortest path distance estimation in large networks

Proceedings of the 18th ACM conference on Information and knowledge management
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm

Journal of Experimental Algorithmics (JEA)
Path oracles for spatial networks

Proceedings of the VLDB Endowment
A sketch-based distance oracle for web-scale graphs

Proceedings of the third ACM international conference on Web search and data mining
Contraction hierarchies: faster and simpler hierarchical routing in road networks

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
TEDI: efficient shortest path query answering on graphs

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Fast and accurate estimation of shortest paths in large graphs

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Highway dimension, shortest paths, and provably efficient algorithms

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On k-skip shortest paths

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A hub-based labeling algorithm for shortest paths in road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
VC-dimension and shortest path algorithms

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Highway hierarchies hasten exact shortest path queries

ESA'05 Proceedings of the 13th annual European conference on Algorithms
A highway-centric labeling approach for answering distance queries on large sparse graphs

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficient processing of distance queries in large graphs: a vertex cover approach

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
K-reach: who is in your small world

Proceedings of the VLDB Endowment
Hierarchical hub labelings for shortest paths

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
The exact distance to destination in undirected world

The VLDB Journal — The International Journal on Very Large Data Bases

Simple, fast, and scalable reachability oracle

Proceedings of the VLDB Endowment
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling

Proceedings of the 23rd international conference on World wide web

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.