Planting Trees for scalable and efficient Canonical Hub Labeling

06/29/2019
by   Kartik Lakhotia, et al.
0

Point-to-Point Shortest Distance (PPSD) query is a crucial primitive in graph database applications. Hub labeling algorithms compute a labeling that converts a PPSD query into a list intersection problem (over a pre-computed indexing) enabling swift query response. However, constructing hub labeling is computationally challenging. Even state-of-the-art parallel algorithms based on Pruned Landmark Labeling (PLL) [3], are plagued by large label size, violation of given network hierarchy, poor scalability and inability to process large graphs. In this paper, we develop novel parallel shared-memory and distributed-memory algorithms for constructing the Canonical Hub Labeling (CHL) that is minimal in size for a given network hierarchy. To the best of our knowledge, none of the existing parallel algorithms guarantee canonical labeling. Our key contribution, the PLaNT algorithm, scales well beyond the limits of current practice by completely avoiding inter-node communication. PLaNT also enables the design of a collaborative label partitioning scheme across multiple nodes for completely in-memory processing of massive graphs whose labels cannot fit on a single machine. Compared to the sequential PLL, we empirically demonstrate upto 47.4x speedup on a 72 thread shared-memory platform. On a 64-node cluster, PLaNT achieves an average 42x speedup over single node execution. Finally, we show how our approach demonstrates superior scalability - we can process 14x larger graphs (in terms of label size) and construct hub labeling orders of magnitude faster compared to state-of-the-art distributed paraPLL algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2019

Graph Iso/Auto-morphism: A Divide- -Conquer Approach

The graph isomorphism is to determine whether two graphs are isomorphic....
research
10/05/2020

Accurate, Efficient and Scalable Training of Graph Neural Networks

Graph Neural Networks (GNNs) are powerful deep learning models to genera...
research
02/19/2019

Hardness of exact distance queries in sparse graphs through hub labeling

A distance labeling scheme is an assignment of bit-labels to the vertice...
research
02/14/2023

Arc-Flags Meet Trip-Based Public Transit Routing

We present Arc-Flag TB, a journey planning algorithm for public transit ...
research
11/29/2022

Local canonical labeling of Erdős–Rényi random graphs

We study local canonical labeling algorithms on an Erdős–Rényi random gr...
research
09/21/2017

Accelerating PageRank using Partition-Centric Processing

PageRank is a fundamental link analysis algorithm and a key representati...
research
06/28/2019

Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!

In this paper, we study how the Pruned Landmark Labeling (PPL) algorithm...

Please sign up or login with your details

Forgot password? Click here to reset