Results 1 
5 of
5
Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach
, 2012
"... We propose a novel diskbased index for processing singlesource shortest path or distance queries. The index is useful in a wide range of important applications (e.g., network analysis, routing planning, etc.). Our index is a treestructured index constructed based on the concept of vertex cover. W ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
(Show Context)
We propose a novel diskbased index for processing singlesource shortest path or distance queries. The index is useful in a wide range of important applications (e.g., network analysis, routing planning, etc.). Our index is a treestructured index constructed based on the concept of vertex cover. We propose an I/Oefficient algorithm to construct the index when the input graph is too large to fit in main memory. We give detailed analysis of I/O and CPU complexity for both index construction and query processing, and verify the efficiency of our index for query processing in massive realworld graphs.
ISLABEL: an IndependentSet based Labeling Scheme for PointtoPoint 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 ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
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 fastgrowing realworld 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. 1.
cluster growing – a first experimental study.
"... approximation of graph diameters by parallel ..."
(Show Context)
Shortest Path Computation over Diskresident Large Graphs based on Extended Bulk Synchronous Parallel Methods
"... Abstract. The Single Source Shortest Path (SSSP) computation over large graphs has raised significant challenges to the memory capacity and processing efficiency. Utilizing diskbased parallel iterative computing is an economic solution. However, costs of disk I/O and communication affect the perfo ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. The Single Source Shortest Path (SSSP) computation over large graphs has raised significant challenges to the memory capacity and processing efficiency. Utilizing diskbased parallel iterative computing is an economic solution. However, costs of disk I/O and communication affect the performance heavily. This paper proposes a statetransition model for SSSP and then designs two optimization strategies based on it. First, we introduce a tunable hash index to reduce the scale of wastef ul data loaded from the disk. Second, we propose a new iterative mechanism and design an Acrossstep Message Pruning (ASMP) policy to deal with the communication bottleneck. The experimental results illustrate that our SSSP computation is 2 times faster than a basic Giraph (a memoryresident parallel framework) implementation. Compared with Hadoop and Hama (diskresident parallel frameworks), the speedup is 21 to 43.