| 摘要 |
<p>The present invention relates to a method for searching subgraph isomorphism using a candidate region search technique and a system thereof and provides a method for searching subgraph isomorphism using a candidate region search technique and a system thereof capable of efficiently and strongly searching subgraph isomorphism using a candidate region search technique which is a new concept. The method for searching subgraph isomorphism using a candidate region search technique according to the present invention comprises the following steps of: selecting a vertex(u_s) of a start inquiry from an inquiry graph(q); obtaining a breath first search(BFS) tree(q′) from the inquiry graph(q); searching a candidate region while going around a data graph(g) from a root vertex(u_s′) of the BFS tree(q′) about each selected start vertex; determining a matching order about the searched candidate region; mapping the start vertex(u_s′) of the BFS tree(q′) on a start vertex(v_s) of a corresponding candidate region; and generating all possible images about each candidate region. The present invention by the above constitution increases search speed when a candidate region is searched, efficiently deletes data vertexes which are not promising. Moreover, the present invention calculates a selection rate about each candidate region instead of the entire graph, thereby generating a stronger matching order by using the accurate information such as the selection rate.</p> |
