loading
Documents

Research.Publish.Connect.

Paper

Authors: Chemseddine Nabti and Hamida Seba

Affiliation: Université de Lyon and Université Lyon 1, France

ISBN: 978-989-758-183-0

Keyword(s): Subgraph Isomorphism, Graph Query, Massive Graph Databases, Graph Summarizing, Modular Decomposition.

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 NP-complete 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.

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.224.150.24

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Nabti C. and Seba H. (2016). Subgraph Isomorphism Search in Massive Graph Databases.In Proceedings of the International Conference on Internet of Things and Big Data - Volume 1: IoTBD, ISBN 978-989-758-183-0, pages 204-213. DOI: 10.5220/0005875002040213

@conference{iotbd16,
author={Chemseddine Nabti and Hamida Seba},
title={Subgraph Isomorphism Search in Massive Graph Databases},
booktitle={Proceedings of the International Conference on Internet of Things and Big Data - Volume 1: IoTBD,},
year={2016},
pages={204-213},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005875002040213},
isbn={978-989-758-183-0},
}

TY - CONF

JO - Proceedings of the International Conference on Internet of Things and Big Data - Volume 1: IoTBD,
TI - Subgraph Isomorphism Search in Massive Graph Databases
SN - 978-989-758-183-0
AU - Nabti C.
AU - Seba H.
PY - 2016
SP - 204
EP - 213
DO - 10.5220/0005875002040213

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.