SuMGra: Querying Multigraphs via Efficient Indexing - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2016

SuMGra: Querying Multigraphs via Efficient Indexing

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.
Fichier principal
Vignette du fichier
Paper.pdf (441.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01362431 , version 1 (08-09-2016)

Identifiers

Cite

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⟩
203 View
393 Download

Altmetric

Share

Gmail Facebook X LinkedIn More