Skip to Main content Skip to Navigation
Theses

Subgraph Isomorphism Search In Massive Graph Data

Abstract : Querying graph data is a fundamental problem that witnesses an increasing interest especially for massive structured data where graphs come as a promising alternative to relational databases for big data modeling. However, querying graph data is different and more complex than querying relational table-based data. The main task involved in querying graph data is subgraph isomorphism search which is an NP-complete problem. Subgraph isomorphism search, is an important problem which is involved in various domains such as pattern recognition, social network analysis, biology, etc. It consists to enumerate the subgraphs of a data graph that match a query graph. The most known solutions of this problem are backtracking-based. They explore a large search space which results in a high computational cost when we deal with massive graph data. To reduce time and memory space complexity of subgraph isomorphism search. We propose to use compressed graphs. In our approach, subgraph isomorphism search is achieved on compressed representations of graphs without decompressing them. Graph compression is performed by grouping vertices into super vertices. This concept is known, in graph theory, as modular decomposition. It is used to generate a tree representation of a graph that highlights groups of vertices that have the same neighbors. With this compression we obtain a substantial reduction of the search space and consequently a significant saving in the processing time. We also propose a novel encoding of vertices that simplifies the filtering of the search space. This new mechanism is called compact neighborhood Index (CNI). A CNI distills all the information around a vertex in a single integer. This simple neighborhood encoding reduces the time complexity of vertex filtering from cubic to quadratic which is considerable for big graphs. We propose also an iterative local global filtering algorithm that relies on the characteristics of CNIs to ensure a global pruning of the search space.We evaluated our approaches on several real-word datasets and compared them with the state of the art algorithms
Document type :
Theses
Complete list of metadata

Cited literature [64 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01781831
Contributor : Abes Star :  Contact
Submitted on : Monday, April 30, 2018 - 5:50:06 PM
Last modification on : Tuesday, June 1, 2021 - 2:08:09 PM
Long-term archiving on: : Monday, September 24, 2018 - 2:47:57 PM

File

TH2017NABTICHEMSEDDINE.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01781831, version 1

Citation

Chems Eddine Nabti. Subgraph Isomorphism Search In Massive Graph Data. Databases [cs.DB]. Université de Lyon, 2017. English. ⟨NNT : 2017LYSE1293⟩. ⟨tel-01781831⟩

Share

Metrics

Record views

522

Files downloads

1606