燕山大学学报2016，Vol.40Issue(6)：517-523,7.DOI:10.3969/j.issn.1007-791X.2016.06.007
URSI：高效的子图同构查询算法
URSI high efficient query algorithm on subgraph isomorphism
摘要
Abstract
The subgraph isomorphism query is used to return subgraph in datagraph which matching with a given query image it is the key problem in data management.Improper matching strategy and a large number of redundant enumeration between nodes and data query and improper pruning strategy can cause redundant computing problem in the query.The query graph is firstly converted into neighbor equivalence class tree and generate candidate area by using the filter conditions Secondly by detecting the candidate region and through the permutations and combination of the nodes in the candidate region will eventually get the node matching order and then all matching subgraph in datagraph can be obtained by validating the data node Finally URSI algorithm based on the above strategy is given and the efficiency of the algorithm can be validated by experiments on real data sets.关键词
子图同构/候选区域探测/排列组合Key words
subgraph isomorphism/candidate region exploration/COMB/PERM分类
信息技术与安全科学引用本文复制引用
余靖,韩玉..URSI：高效的子图同构查询算法[J].燕山大学学报,2016,40(6):517-523,7.基金项目
国家自然科学基金资助项目 （）
