Skip to Main content Skip to Navigation
Conference papers

Subgraph Isomorphism Search in Massive Graph Databases

Chemseddine Nabti 1 Hamida Seba 1
1 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : Subgraph isomorphism search is a basic task in querying graph data. It consists to find all embeddings of a query graph in a data graph. It is encountered in many real world applications that require the management of structural data such as bioinformatics and chemistry. However, Subgraph isomorphism search is an NPcomplete problem which is prohibitively expensive in both memory and time in massive graph databases. To tackle this problem, we propose a new approach based on concepts widely different from existing works. Our approach relies on a summarized representation of the graph database that minimizes both the amount space required to store data graphs and the processing time of querying them. Experimental results show that our approach performs well compared to the most efficient approach of the literature.
Document type :
Conference papers
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download
Contributor : Hamida Seba Connect in order to contact the contributor
Submitted on : Wednesday, November 16, 2016 - 10:30:48 AM
Last modification on : Tuesday, June 1, 2021 - 2:08:09 PM
Long-term archiving on: : Thursday, March 16, 2017 - 11:22:07 AM


Files produced by the author(s)


  • HAL Id : hal-01313922, version 1


Chemseddine Nabti, Hamida Seba. Subgraph Isomorphism Search in Massive Graph Databases. The International Conference on Internet of Things and Big Data – IoTBD 2016, Apr 2016, Rome, Italy. ⟨hal-01313922⟩



Les métriques sont temporairement indisponibles