当前位置: X-MOL 学术Int. J. Pattern Recognit. Artif. Intell. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Graph Pattern Matching: Capturing Bisimilar Subgraph
International Journal of Pattern Recognition and Artificial Intelligence ( IF 1.5 ) Pub Date : 2020-10-28 , DOI: 10.1142/s0218001421500117
Rui Qiao 1, 2 , Ke Feng 1 , Heng He 1, 2 , Xiaolei Zhong 3
Affiliation  

Graph pattern matching that aims to seek out answer graphs in a data graph matching a provided graph, plays a fundamental role as a part of graph search for graph databases. “Matching” indicates that the two graphs are correlated, such as bisimulation, isomorphism, simulation, etc. The strictness of bisimulation is between simulation and isomorphism. Seldom work has been done to search for bisimulation subgraphs. This research focuses on the problem. The symbol is introduced to fundamental modal logic language, thereby yielding ML+ language; the symbols is added for forming ML+ formulas. Then conclusions about graph bisimulations are shown. Subsequently, a theorem with detailed proof is presented, stating that ML+ formulas characterize finite directed graphs modulo bisimulation. According to the conclusions and theorem, algorithms for finding subgraphs are proposed. After dividing the query graph, the match graphs undergo the characterization using ML+ formulas. In the data graphs, by model checking the formulas, the answer graphs exhibiting bisimilarity to the match graphs are able to be captured.

中文翻译:

图模式匹配:捕获双相似子图

图形模式匹配旨在寻找与提供的图形匹配的数据图形中的答案图形,作为图形数据库的图形搜索的一部分起着基本作用。“匹配”表示两个图是相关的,如双模拟、同构、模拟等。双模拟的严格性介于模拟和同构之间。搜索双模拟子图的工作很少。本研究重点关注这个问题。符号*被引入基本模态逻辑语言,从而产生大号+*语言; 符号*添加用于形成大号+*公式。然后给出关于图互模拟的结论。随后,提出了一个带有详细证明的定理,指出大号+*公式表征有限有向图模双模拟。根据结论和定理,提出了寻找子图的算法。划分查询图后,匹配图使用大号+*公式。在数据图中,通过模型检查公式,能够捕获与匹配图表现出双相似性的答案图。
更新日期:2020-10-28
down
wechat
bug