DefinePK

Abstract

The objective of this paper is to reduce the retrieval time while processing a query graph. Graph is the powerful way to analyze a large database. Any given data can be easily visualized in graphical format. Sub graph matching is one of the most important factor when dealing with huge database. It retrieves structurally isomorphic sub graph when comparing query data with large graph data. The isomorphic problem has been overcome with the help of node Index. Neo4j is a powerful tool, which is used to visualize the query in graph method and to retrieve the matching sub graph in faster way. A pruning method is followed along with a Dynamic Sub Graph-Matching algorithm (DSMA) to solve the isomorphic problem. Rich information is available in every vertex of a social network graphs and it is effectively used while querying.