Title
SubGraph2Vec: Highly-Vectorized Tree-like Subgraph Counting
Abstract
Subgraph counting aims to count occurrences of a template T in a given network G (V, E). It is a powerful graph analysis tool and has found real-world applications in diverse domains. Scaling subgraph counting problems is known to be memory bounded and computationally challenging with exponential complexity. Although scalable parallel algorithms are known for several graph problems such as Triangle Counting and PageRank, this is not common for counting complex subgraphs. Here we address this challenge and study connected acyclic graphs or trees. We propose a novel vectorized subgraph counting algorithm, named SUBGRAPH2VEC, as well as both shared memory and distributed implementations: 1) reducing algorithmic complexity by minimizing neighbor traversal; 2) achieving a highly-vectorized implementation upon linear algebra kernels to significantly improve performance and hardware utilization. 3) SUBGRAPH2VEC improves the overall performance over the state-of-the-art work by orders of magnitude and up to 660x on a single node. 4) SUBGRAPH2VEC in distributed mode can scale up the template size to 20 and maintain good strong scalability. 5) enabling portability to both CPU and GPU.
Year
DOI
Venue
2019
10.1109/BigData47090.2019.9006037
2019 IEEE International Conference on Big Data (Big Data)
Keywords
Field
DocType
Subgraph Counting,Vectorization,Portability
PageRank,Data mining,Linear algebra,Tree traversal,Shared memory,Computer science,Parallel computing,Vectorization (mathematics),Counting problem,Power graph analysis,Scalability
Conference
ISSN
ISBN
Citations 
2639-1589
978-1-7281-0859-9
0
PageRank 
References 
Authors
0.34
0
9
Name
Order
Citations
PageRank
Langshi Chen111.70
Jiayu Li201.01
Cenk Sahinalp300.34
Madhav Marathe42775262.17
Anil Vullikanti501.35
Andrey Nikolaev601.01
Egor Smimov700.34
Ruslan Israfilov800.68
and Judy Qiu900.34