HGMatch:超图子图匹配的超边匹配方法
HGMatch: A Match-by-Hyperedge Approach for Subgraph Matching on Hypergraphs
摘要:
超图是一个超边可以连接任意数量顶点的图的推广。与传统的图相比,它可以描述实体之间的n元关系和高阶信息。本文研究超图上的子图匹配问题(即子超图匹配)。现有的方法直接扩展子图匹配算法的超图的情况下。然而,这种方法延迟了超边验证,并且没有充分利用超图中的高阶信息,导致大的搜索空间和高的枚举成本。此外,随着超图规模的不断增大,子超图匹配的顺序计算变得越来越困难。因此,我们提出了一个有效的和并行的子超图匹配系统,HGMatch,处理子超图匹配在大规模超图。我们提出了一种新的超边匹配框架,利用超图中的高阶信息,并使用集合运算进行有效的候选生成。此外,我们开发了一个优化的并行执行引擎在HGMatch的基础上的Challowlow模型,它具有基于任务的调度和细粒度的动态工作窃取,以实现有限的内存执行和更好的负载均衡。对10个真实数据集的实验评估表明,HGMatch在使用单个线程时,性能优于最先进的子图匹配算法(CFL,ESTA,CECI和RapidMatch)的扩展版本的数量级,并在线程数量增加时实现几乎线性的可扩展性。
英文摘要:
Hypergraphs are generalisation of graphs in which a hyperedge can connect any number of vertices. It can describe n-ary relationships and high-order information among entities compared to conventional graphs. In this paper, we study the fundamental problem of subgraph matching on hypergraphs (i.e, subhypergraph matching). Existing methods directly extend subgraph matching algorithms to the case of hypergraphs. However, this approach delays hyperedge verification and underutilises the high-order information in hypergraphs, which leads to large search space and high enumeration cost. Furthermore, with the growing size of hypergraphs, it is becoming hard to compute subhypergraph matching sequentially. Thus, we propose an efficient and parallel subhypergraph matching system, HGMatch, to handle subhypergraph matching in massive hypergraphs. We proposes a novel match-by-hyperedge framework to utilise high-order information in hypergraphs and uses set operations for efficient candidates generation. Moreover, we develop an optimised parallel execution engine in HGMatch based on the dataflow model, which features a task-based scheduler and fine-grained dynamic work stealing to achieve bounded memory execution and better load balancing. Experimental evaluation on 10 real-world datasets shows that HGMatch outperforms the extended version of the state-of-the-art subgraph matching algorithms (CFL, DAF, CECI and RapidMatch) by orders of magnitude when using a single thread, and achieves almost linear scalability when the number of threads increases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。