RAISIN: A Parallel Subgraph Matching Tool Exploiting Community Structures in Social Networks

Subgraph matching is a fundamental operation in graph data management and facilitates the analysis of complex datasets in various domains such as computer vision, bioinformatics, and social networks. With the scale of graph data getting larger and larger, the performance of subgraph matching algorithms is facing significant challenges. However, existing tools are not efficient enough for subgraph matching tasks. In this paper, we present a subgraph matching tool called RAISIN. To improve the efficiency of subgraph matching tasks, RAISIN accelerates the algorithms of the matching engine with community-structure-based and parallelism optimization. Moreover, to improve user-friendliness, RAISIN provides a graphical user interface to monitor the matching process and visualize matching results. Finally, three use cases are presented to demonstrate the efficiency and user-friendliness of RAISIN.