arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.14420cs.DB
收藏

利用搜索失败进行快速子图匹配

Fast Subgraph Matching by Exploiting Search Failures

Junya Arai, Makoto Onizuka, Yasuhiro Fujiwara, Sotetsu Iwamura

摘要:

子图匹配是一个计算密集型问题,要求枚举数据图中查询图的所有同构嵌入。这个问题通常通过回溯来解决,回溯递归地进化每一个可能的部分嵌入,直到它成为同构嵌入或发现不能成为同构嵌入。虽然现有的方法在开始回溯之前通过分析图的结构来减少搜索空间,但对于复杂图通常是无效的。在本文中,我们提出了一个有效的子图匹配算法,在回溯过程中进行动态修剪。我们的主要思想是“从失败中学习”。也就是说,我们的算法产生故障模式时,发现部分嵌入无法成为同构嵌入。然后,在后续的回溯过程中,我们的算法修剪部分嵌入匹配的失败模式。这种修剪不会改变结果,因为故障模式被设计为表示永远不会产生同构嵌入的条件。此外,我们引入了一个有效的表示故障模式的恒定时间模式匹配。实验结果表明,我们的方法提高了性能高达10000倍,比现有的方法。

英文摘要:

Subgraph matching is a compute-intensive problem that asks to enumerate all the isomorphic embeddings of a query graph within a data graph. This problem is generally solved with backtracking, which recursively evolves every possible partial embedding until it becomes an isomorphic embedding or is found unable to become it. While existing methods reduce the search space by analyzing graph structures before starting the backtracking, it is often ineffective for complex graphs. In this paper, we propose an efficient algorithm for subgraph matching that performs on-the-fly pruning during the backtracking. Our main idea is to `learn from failure'. That is, our algorithm generates failure patterns when a partial embedding is found unable to become an isomorphic embedding. Then, in the subsequent process of the backtracking, our algorithm prunes partial embeddings matched with a failure pattern. This pruning does not change the result because failure patterns are designed to represent the conditions that never yield an isomorphic embedding. Additionally, we introduce an efficient representation of failure patterns for constant-time pattern matching. The experimental results show that our method improves the performance by up to 10000 times than existing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑