International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
www.ijsr.net | Most Trusted Research Journal Since Year 2012

ISSN: 2319-7064

Research Paper | Computer Science & Engineering | India | Volume 2 Issue 5, May 2013

Indexing Frequent Subgraphs in Large graph Database using Parallelization

Swati C. Manekar, Manish Narnaware

Plenty of structural patterns in real world have been represented as graph like molecules, chemical compounds, social network, road network etc. Mining this graph for extracting some useful information is of special interest and has many applications. The application includes drug discovery, compound synthesis, anomaly detection in network, social network analysis for finding groups etc. One of the most interesting problems in graph mining is graph containment problem. In graph containment problem, given a query graph q, it is asked to find all graph in given graph dataset containing this query (query graph as subgraph).This means finding all graph which is isomorphic to query graph. As in real world there is vast number of graph in graph dataset so this task of subgraph isomorphism test become tedious, complex, time and space consuming. So it is necessary to create an index of graphs present in dataset for cost efficient query processing. In this paper we proposed a time efficient graph indexing technique using discriminative frequent subgraph as indexing feature for molecular datasets using parallel approach. We proposed a method which will find frequent subgraphs using better pruning capability and executed in multithreaded environment in parallel manner. Our experimental studies conceal that parallelization method for graph indexing which has a condensed index structure, achieves an order of degree better performance in index construction, and significantly, outperforms state-of-the-art graph based indexing methods

Keywords: Graph indexing, graph mining, frequent structure based approach, parallelization approach

Edition: Volume 2 Issue 5, May 2013

Pages: 426 - 430


How to Cite this Article?

Swati C. Manekar, Manish Narnaware, "Indexing Frequent Subgraphs in Large graph Database using Parallelization", International Journal of Science and Research (IJSR), https://www.ijsr.net/search_index_results_paperid.php?id=IJSRON12013105, Volume 2 Issue 5, May 2013, 426 - 430

26 PDF Views | 14 PDF Downloads

Download Article PDF



Similar Articles with Keyword 'graph mining'

Research Paper, Computer Science & Engineering, India, Volume 3 Issue 6, June 2014

Pages: 1629 - 1633

Graph Presentation in GMine System using Efficient Algorithm

Shafali Gupta, Ulka Panchal

Share this article

M.Tech / M.E / PhD Thesis, Computer Science & Engineering, India, Volume 4 Issue 5, May 2015

Pages: 645 - 649

Software Theft Detection for JavaScript Programs Based on Dynamic Birthmark Extracted from Runtime Heap Graph

Somanath Janardan Salunkhe, Umesh Laxman Kulkarni

Share this article

Research Paper, Computer Science & Engineering, India, Volume 2 Issue 5, May 2013

Pages: 426 - 430

Indexing Frequent Subgraphs in Large graph Database using Parallelization

Swati C. Manekar, Manish Narnaware

Share this article

Survey Paper, Computer Science & Engineering, India, Volume 3 Issue 11, November 2014

Pages: 3012 - 3016

Survey of Correlated Probabilistic Graph

Sawant Ashlesha G., Gadekar Devendra P

Share this article

Research Paper, Computer Science & Engineering, India, Volume 5 Issue 8, August 2016

Pages: 534 - 537

Graph Mining ? To Extract Information Using Human Interaction based on Pattern Discovery

Dr. D. Durga Bhavani

Share this article

Top