Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
Distance Labeling Schemes for Well-Separated Graph Classes
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Approximate distance oracles for unweighted graphs in expected O(n2) time
ACM Transactions on Algorithms (TALG)
Efficient algorithms for exact ranked twig-pattern matching over graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proximity-preserving labeling schemes
Journal of Graph Theory
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
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
A sketch-based distance oracle for web-scale graphs
Proceedings of the third ACM international conference on Web search and data mining
Treewidth computations I. Upper bounds
Information and Computation
Distance Oracles for Sparse Graphs
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
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
Keyword Search in Databases
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
GRAIL: scalable reachability index for large graphs
Proceedings of the VLDB Endowment
Graph indexing of road networks for shortest path queries with label restrictions
Proceedings of the VLDB Endowment
Finding shortest path on land surface
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A memory efficient reachability data structure through bit vector compression
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Shortest distance queries are essential not only in graph analysis and graph mining tasks but also in database applications, when a large graph needs to be dealt with. Such shortest distance queries are frequently issued by end-users or requested as a subroutine in real applications. For intensive queries on large graphs, it is impractical to compute shortest distances on-line from scratch, and impractical to materialize all-pairs shortest distances. In the literature, 2-hop distance labeling is proposed to index the all-pairs shortest distances. It assigns distance labels to vertices in a large graph in a pre-computing step off-line and then answers shortest distance queries on-line by making use of such distance labels, which avoids exhaustively traversing the large graph when answering queries. However, the existing algorithms to generate 2-hop distance labels are not scalable to large graphs. Finding an optimal 2-hop distance labeling is NP-hard, and heuristic algorithms may generate large size distance labels while still needing to pre-compute all-pairs shortest paths. In this paper, we propose a multi-hop distance labeling approach, which generates a subset of the 2-hop distance labels as index off-line. We can compute the multi-hop distance labels efficiently by avoiding pre-computing all-pairs shortest paths. In addition, our multi-hop distance labeling is small in size to be stored. To answer a shortest distance query between two vertices, we first generate the query-specific small set of 2-hop distance labels for the two vertices based on our multi-hop distance labels stored and compute the shortest distance between the two vertices based on the 2-hop distance labels generated on-line. We conducted extensive performance studies on large real graphs and confirmed the efficiency of our multi-hop distance labeling scheme.