Subgraph Matching With Set Similarity In Large Graph Database

• Author(s):

  Shruti Rakte | Dhanshri Patil | Pratiksha Shinde | Aniket Chimurkar, Deepa Abin

• Keywords:

  SMS2, DS Match Algorithm, Vertical And Horizontal Pruning.

• Abstract:

  In Real-world Graphs Such As Social Networks, Semantic Web And Biological Networks, Each Vertex Usually Contains Rich Information, Which Can Be Modelled By A Set Of Tokens Or Elements. We Use A Subgraph Matching With Set Similarity (SMS2) Query Over A La

---

Other Details

• Paper id:

  IJSARTV3I48877

• Published in:

  Volume: 3 Issue: 4 April 2017

• Publication Date:

  2017-04-10

Download Article