SUBGRAPH WITH SET SIMILARITY IN ADATABASE
Vinjamuri Kantha Rao · Asia-pacific Journal of Convergent Research Interchange · 2017
In real-world graphs like social networks, linguistics net and biological networks, every vertex typically contains wealthy info, which might be shapely by a group of tokens or parts.during this paper, we have a tendency to study a subgraph matching with set similarity (SMS2) question over an outsized graph information, that retrieves subgraphs that ar structurally isomorphous to the question graph, and in the meantime satisfy the condition of vertex try matching with the (dynamic) weighted set similarity.To with efficiency method the SMS2 question, this paper styles a unique lattice-based index for knowledge graph, and light-weight signatures for each question vertices and knowledge vertices.supported the index and signatures, we have a tendency to propose associate economical two-phase pruning strategy as well as set similarity pruning and structure-based pruning, that exploits the distinctive options of each (dynamic) weighted set similarity and graph topology.we have a tendency to conjointly propose associate economical dominating-set-based subgraph matching formula radio-controlled by a dominating set choice formula to realize higher question performance.in depth experiments on each real and artificial datasets demonstrate that our technique outperforms progressive strategies by associate order of magnitude.