Continuous subgraph matching (CSM) is a critical task for analyzing dynamic graphs and has a wide range of applications, such as merchant fraud detection, cyber-attack hunting, and rumor detection. Although many efficient CSM algorithms have been recently proposed, they are mainly designed to process a single query. However, in some application scenarios, multi-query oriented continuous subgraph matching (MQCSM) is more critical. To our knowledge, the two existing solutions to MQCSM are outdated due to unsatisfactory performance. In this paper, we propose MQ-Match, an efficient approach for MQCSM. Specifically, we design a compact index structure, called candidate classification graph (CCG), to maintain local matching relations in the data graph and prune invalid can-didate expansions. We further develop a computation sharing incremental matching method based on shared matching trees, where common structures among query graphs are merged and processed once for each graph update. To reduce redundant search caused by automorphisms, we introduce an optimization approach MQ-Match∗. Specifically, we introduce an exclusion set based optimization that prunes symmetric search branches and directly generates symmetric results. Extensive experiments on real datasets show that MQ-Match∗ achieves 2.0x-37280.7x speedup over existing methods with much less memory in most settings, while scaling to billion-edge graph.
原文链接
分享
引用
