Subgraph Isomorphism Search in Massive Graph Databases - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Subgraph Isomorphism Search in Massive Graph Databases

Chemseddine Nabti
Hamida Seba


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.
Fichier principal
Vignette du fichier
Nabti-Seba-2016.pdf (157.27 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01313922 , version 1 (16-11-2016)


  • 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⟩
255 View
1542 Download


Gmail Mastodon Facebook X LinkedIn More