桂林电子科技大学学报2026，Vol.46Issue(4)：372-378,7.DOI:10.16725/j.1673-808X.2023195
基于ADD的图模式匹配双向模拟符号算法
Dual simulation symbolic algorithm for graph pattern matching based on ADD
摘要
Abstract
To optimize the sequential checking and update operations during dual simulation,this paper proposes a graph pattern-matching algorithm based on Algebraic Decision Diagram(ADD),namely GSDD,which optimizes the sequential checking and up-date operations during matching execution.The proposed GSDD algorithm employs algebraic decision diagrams to construct sym-bolic representations of both pattern graphs and data graphs.The algorithm performs symbolic set operations in memory,allowing multiple candidate nodes to be processed in parallel rather than sequentially.A novel label-constrained filtering strategy is further in-troduced to jointly process a node and its immediate neighbours,thereby improving candidate set pruning in dual simulation.Subse-quently,a backtracking strategy is adopted to further refine the candidate node set.Experimental results demonstrate that the pro-posed GSDD algorithm effectively improves graph pattern matching efficiency compared with the conventional dual simulation method.关键词
图模式匹配/双向模拟/代数决策图/并行处理/标签约束Key words
graph pattern matching/dual simulation/algebraic decision diagrams/parallel processing/label constraint分类
信息技术与安全科学引用本文复制引用
余龙泉,徐周波,李上铨..基于ADD的图模式匹配双向模拟符号算法[J].桂林电子科技大学学报,2026,46(4):372-378,7.基金项目
国家自然科学基金(62362012) （62362012）
