A GraphBLAS Approach for Subgraph Counting

03/11/2019
by   Langshi Chen, et al.
0

Subgraph counting aims to count the occurrences of a subgraph template T in a given network G. The basic problem of computing structural properties such as counting triangles and other subgraphs has found applications in diverse domains. Recent biological, social, cybersecurity and sensor network applications have motivated solving such problems on massive networks with billions of vertices. The larger subgraph problem is known to be memory bounded and computationally challenging to scale; the complexity grows both as a function of T and G. In this paper, we study the non-induced tree subgraph counting problem, propose a novel layered softwarehardware co-design approach, and implement a shared-memory multi-threaded algorithm: 1) reducing the complexity of the parallel color-coding algorithm by identifying and pruning redundant graph traversal; 2) achieving a fully-vectorized implementation upon linear algebra kernels inspired by GraphBLAS, which significantly improves cache usage and maximizes memory bandwidth utilization. Experiments show that our implementation improves the overall performance over the state-of-the-art work by orders of magnitude and up to 660x for subgraph templates with size over 12 on a dual-socket Intel(R) Xeon(R) Platinum 8160 server. We believe our approach using GraphBLAS with optimized sparse linear algebra can be applied to other massive subgraph counting problems and emerging high-memory bandwidth hardware architectures.

READ FULL TEXT
research
09/23/2020

SubGraph2Vec: Highly-Vectorized Tree-likeSubgraph Counting

Subgraph counting aims to count occurrences of a template T in a given n...
research
04/25/2018

High-Performance Massive Subgraph Counting using Pipelined Adaptive-Group Communication

Subgraph counting aims to count the number of occurrences of a subgraph ...
research
12/25/2019

Neural Subgraph Isomorphism Counting

In this paper, we study a new graph learning problem: learning to count ...
research
01/15/2020

A color-avoiding approach to subgraph counting in bounded expansion classes

We present an algorithm to count the number of occurrences of a pattern ...
research
01/09/2023

Space-Query Tradeoffs in Range Subgraph Counting and Listing

This paper initializes the study of range subgraph counting and range su...
research
08/29/2019

Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem

We consider the subgraph isomorphism problem where, given two graphs G (...
research
10/29/2019

A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets

Computing subgraph frequencies is a fundamental task that lies at the co...

Please sign up or login with your details

Forgot password? Click here to reset