• Nilofar Rafik Chaus
• Prof.Prashant Jawalkar

Due to drastic increase in digital data searching process takes higher space and time complexity. Most of the searching techniques are existed, each one of them use one or other method to achieve better performance grade. Many methodologies uses tree inclusion technique to improve the searching process where as some other includes graph pattern formation to search the given queries efficiently. This paper concentrates on combining graph approach and tree technique to search the required query more efficiently. Paper put forwards an idea of using the graph database to store the pre created hyper graph entities to create the weighted based entities eventually that eases the process of searching. Proposed technique identifies the weight of each entity to be search and based on the weight it creates M-tree that is sorted according to node weights. These node weights eventually create the clusters as the answers for the searched query.

Tree, hyper graph, neo 4j, clusters, Pattern

"Heuristic Approach for sub graph Pattern search using tree technique", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.4, Issue 7, page no.122-126, July-2017, Available :http://www.jetir.org/papers/JETIR1707022.pdf

"Heuristic Approach for sub graph Pattern search using tree technique", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.4, Issue 7, page no. pp122-126, July-2017, Available at : http://www.jetir.org/papers/JETIR1707022.pdf