Loading...
Please wait, while we are loading the content...
Similar Documents
Subgraph Isomorphism Search in Massive Graph Databases
| Content Provider | Hyper Articles en Ligne (HAL) |
|---|---|
| Author | Nabti, Chemseddine Seba, Hamida |
| Abstract | Subgraph isomorphism search is a basic task in querying graph data. It consists to find all embeddings of aquery graph in a data graph. It is encountered in many real world applications that require the managementof structural data such as bioinformatics and chemistry. However, Subgraph isomorphism search is an NPcompleteproblem which is prohibitively expensive in both memory and time in massive graph databases. Totackle this problem, we propose a new approach based on concepts widely different from existing works. Ourapproach relies on a summarized representation of the graph database that minimizes both the amount spacerequired to store data graphs and the processing time of querying them. Experimental results show that ourapproach performs well compared to the most efficient approach of the literature. |
| File Format | |
| Language | English |
| Publisher Date | 2016-04-22 |
| Access Restriction | Open |
| Subject Keyword | Subgraph isomorphism graph query massive graph databases graph summarizing modular decomposition info Computer Science [cs] Data Structures and Algorithms [cs.DS] |
| Content Type | Text |
| Resource Type | Article |
