A Survey on Subgraph Matching Algorithm for Graph Database
Journal: International Journal for Scientific Research and Development | IJSRD (Vol.3, No. 11)Publication Date: 2016-02-01
Authors : Maninder Kaur Rajput; Snehal Kamalapur;
Page : 149-152
Keywords : Graph Database; Isomorphism; Offline Phase; Online Phase; Subgraph Matching;
Abstract
Subgraph matching is a technique to retrieve subgraphs which are isomorphic to query graph. A graph S (VS, ES) is subgraph of graph G (VG, EG) if VS âŠâ? VG and ES âŠâ? EG. Subgraph matching is a process to fetch all subgraphs S (VS, ES) from graph G (VG, EG) which are structurally isomorphic to input graph I(VI, EI) using subgraph matching algorithm. Subgraph matching is a NP-hard. In real-world graphs such as semantic web, social networks, protein interaction and biological networks, subgraph matching will retrieve subgraphs which are isomorphic to query graph from data graph. Many subgraph matching algorithms have proposed in recent years, these algorithms aims to find desired results in less time for real datasets using information like join orders, pruning techniques and vertex neighbour information. Subgraph matching algorithms can be classified into two clases: exact and approximate matching algorithms. These two approaches are being described in survey.
Other Latest Articles
- SmartDigger: A Two-stage Crawler for Efficiently Harvesting Deep-Web
- Study on various GDI techniques for low power, high speed Full adder design
- RFID Based Traffic Sign Recognition
- Virtual Exercise Using Kinect Sensor
- BER Performance of MIMO with Orthogonal Space Time Block Code Using FEC and Various Modulation Techniques
Last modified: 2016-02-12 19:15:53