Skip to main content
Log in

GPU acceleration of subgraph isomorphism search in large scale graph

  • Published:
Journal of Central South University Aims and scope Submit manuscript


A novel framework for parallel subgraph isomorphism on GPUs is proposed, named GPUSI, which consists of GPU region exploration and GPU subgraph matching. The GPUSI iteratively enumerates subgraph instances and solves the subgraph isomorphism in a divide-and-conquer fashion. The framework completely relies on the graph traversal, and avoids the explicit join operation. Moreover, in order to improve its performance, a task-queue based method and the virtual-CSR graph structure are used to balance the workload among warps, and warp-centric programming model is used to balance the workload among threads in a warp. The prototype of GPUSI is implemented, and comprehensive experiments of various graph isomorphism operations are carried on diverse large graphs. The experiments clearly demonstrate that GPUSI has good scalability and can achieve speed-up of 1.4–2.6 compared to the state-of-the-art solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others


  1. HE Hua-hai, SINGH A K. Graphs-at-a-time: Query language and access methods for graph databases [C]// Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. USA: ACM, 2008: 405–418.

    Google Scholar 

  2. ZASLAVSKIY M, BACH F, VERT J P. Global alignment of protein–protein interaction networks by graph matching methods [J]. Bioinformatics, 2009, 25(12): 1259–1267.

    Article  Google Scholar 

  3. DESHPANDE M, KURAMOCHI M, WALE N, KARYPIS G. Frequent substructure-based approaches for classifying chemical compounds [J]. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(8): 1036–1050.

    Article  Google Scholar 

  4. OHLRICH M, EBELING C, GINTING E, SATHER L. SubGemini: Identifying subcircuits using a fast subgraph isomorphism algorithm [C]// Proceedings of the 30th international Design Automation Conference. USA: ACM, 1993: 31–37.

    Google Scholar 

  5. YAN Xi-feng, YU P S, HAN Jia-wei. Graph indexing: A frequent structure-based approach [C]// Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data. USA: ACM, 2004: 335–346.

    Book  Google Scholar 

  6. SHANG Hai-chuan, ZHANG Ying, LIN Xue-min, YU J X. Taming verification hardness: An efficient algorithm for testing subgraph isomorphism [J]. Proceedings of the VLDB Endowment, 2008, 1(1): 364–375.

    Article  Google Scholar 

  7. NVIDIA C. Compute unified device architecture programming guide [M]. Santa Clara, CA: NVIDIA Corporation, 2010: 3–5.

    Google Scholar 

  8. CORDELLA L P, FOGGIA P, SANSONE C, VENTO M. A (sub) graph isomorphism algorithm for matching large graphs [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(10): 1367–1372.

    Article  Google Scholar 

  9. ZHAO Pei-xiang, HAN Jia-wei. On graph query optimization in large networks [J]. Proceedings of the VLDB Endowment, 2010, 3(1/2): 340–351.

    Article  Google Scholar 

  10. ZHANG Shi-jie, LI Shi-rong, YANG Jiong. GADDI: Distance index based subgraph matching in biological networks [C]// Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology. USA: ACM, 2009: 192–203.

    Google Scholar 

  11. HAN W S, LEE J, LEE J H. Turbo iso: Towards ultrafast and robust subgraph isomorphism search in large graph databases [C]// Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. USA: ACM, 2013: 337–348.

    Google Scholar 

  12. SHAO Bin, WANG Hai-xun, LI Yao-tao. Trinity: A distributed graph engine on a memory cloud [C]// Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. USA: ACM, 2013: 505–516.

    Google Scholar 

  13. JENKINS J, ARKATKAR I, OWENS J D,CHOUDHARY A, SAMATOVA N F. Lessons learned from exploring the backtracking paradigm on the GPU [C]// Euro-Par 2011 Parallel Processing. Berlin: Springer, 2011: 425–437.

    Book  Google Scholar 

  14. HONG S, KIM S K, OGUNTEBI T, OLUKOTUN K. Accelerating CUDA graph algorithms at maximum warp [J]. ACM SIGPLAN Notices, 2011, 46(8): 267–276.

    Article  Google Scholar 

  15. HWU W. GPU Computing Gems Emerald Edition [M]. Elsevier, 2011: 105–113.

    Google Scholar 

  16. SUN Zhao, WANG Hong-zhi, WANG Hai-xun, SHAO Bin, LI Jian-zhong. Efficient subgraph matching on billion node graphs [J]. Proceedings of the VLDB Endowment, 2012, 5(9): 788–799.

    Article  Google Scholar 

  17. LIN Xiao-jie, ZHANG Rui, WEN Ze-yi, WANG Hong-zhi, QI Jianzhong. Efficient Subgraph Matching Using GPUs [M]// Databases Theory and Applications. Berlin: Springer, 2014: 74–85.

    Google Scholar 

  18. LEE J, HAN W S, KASPEROVICS R, LEE J H. An in-depth comparison of subgraph isomorphism algorithms in graph databases [J]. Proceedings of the VLDB Endowment, 2012, 6(2): 133–144.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Bo Yang  (杨博).

Additional information

Foundation item: Projects(61272142, 61103082, 61003075, 61170261, 61103193) supported by the National Natural Science Foundation of China; Project supported by Funds for New Century Excellent Talents in University of China; Projects(2012AA01A301, 2012AA010901) supported by the National High Technology Research and Development Program of China

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, B., Lu, K., Gao, Yh. et al. GPU acceleration of subgraph isomorphism search in large scale graph. J. Cent. South Univ. 22, 2238–2249 (2015).

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: