Distributed Reachability Queries On Massive Graphs

Reachability querying is one of the most fundamental graph problems, and it has many applications in graph analytics and processing. Although a substantial number of algorithms are proposed, most of them are centralized and cannot scale to massive graphs that are distributed across multiple data centers. In this paper, we study the problem of distributed reachability queries, and present an efficient distributed reachability index, called Parallel Vertex Labeling (PVL), together with two lemmas to accelerate the query. Using real datasets, we demonstrate that our solutions achieve better indexing performance and significantly outperform the state-of-the-art distributed techniques.