SuMGra: Querying Multigraphs via Efficient Indexing

Vijay Ingalalli 1, 2 Dino Ienco 1, 2 Pascal Poncelet 2
2 ADVANSE - ADVanced Analytics for data SciencE
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Many real world datasets can be represented by a network with a set of nodes interconnected with each other by multiple relations. Such a rich graph is called a multigraph. Unfortunately, all the existing algorithms for subgraph query matching are not able to adequately leverage multiple relationships that exist between the nodes. In this paper we propose an efficient indexing schema for querying single large multi-graphs, where the indexing schema aptly captures the neighbourhood structure in the data graph. Our proposal SuMGra couples this novel indexing schema with a subgraph search algorithm to quickly traverse though the solution space to enumerate all the matchings. Extensive experiments conducted on real benchmarks prove the time efficiency as well as the scalability of SuMGra.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01362431
Contributor : Pascal Poncelet <>
Submitted on : Thursday, September 8, 2016 - 5:14:01 PM
Last modification on : Friday, March 29, 2019 - 9:12:06 AM
Long-term archiving on : Friday, December 9, 2016 - 1:18:08 PM

File

Paper.pdf
Files produced by the author(s)

Identifiers

Citation

Vijay Ingalalli, Dino Ienco, Pascal Poncelet. SuMGra: Querying Multigraphs via Efficient Indexing. DEXA: Database and Expert Systems Applications, Sep 2016, Porto, Portugal. pp.387-401, ⟨10.1007/978-3-319-44403-1_24⟩. ⟨lirmm-01362431⟩

Share

Metrics

Record views

225

Files downloads

302