计算机应用研究2023，Vol.40Issue(12)：3672-3677,6.DOI:10.19734/j.issn.1001-3695.2023.04.0176
基于邻域安全压缩的动态图增量子图匹配算法
Incremental subgraph matching algorithm based on neighborhood safe compression on dynamic graph
摘要
Abstract
Aiming at the problem of information redundancy in the index structure DCS in Symbi,the most advanced incre-mental subgraph matching algorithm,this paper proposed a new index structure CDCS,and proposed the CDCS update algo-rithm INCCDCS to the CDCS index structure and dynamically maintained matching results,and finally proposed an incremental subgraph matching algorithm CSymbi for dynamic graphs.By introducing neighborhood information constraints,the method fil-tered candidate sets during the process of constructing and updating auxiliary structures,and improved the solution efficiency of the algorithm.Finally,it was verified on the Netflow dataset and LSBench dataset.Compared with the existing methods,the number of candidate nodes can be reduced by up to 56％,and the number of candidate edges can be reduced by up to 62％,which effectively reduces the calculation space and improves the solution efficiency.关键词
动态图/增量子图匹配/邻域约束/CSymbiKey words
dynamic graph/incremental subgraph matching/neighborhood constraint/CSymbi分类
信息技术与安全科学引用本文复制引用
徐周波,许昌胜,王嘉鑫..基于邻域安全压缩的动态图增量子图匹配算法[J].计算机应用研究,2023,40(12):3672-3677,6.基金项目
国家自然科学基金资助项目(61762027) （61762027）
