A Relational-Based Approach for Aggregated Search in Graph Databases

Thanh-Huy Le 1 Haytham Elghazel 2 Mohand-Said Hacid 3
2 DM2L - Data Mining and Machine Learning
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
3 BD - Base de Données
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : In this paper, we investigate the problem of assembling fragments from different graphs to build an answer to a user query. The goal is to be able to provide an answer, by aggregation, when a single graph cannot satisfy all the query constraints. We provide the underlying basic algorithms and a relational framework to support aggregated search in graph databases. Our objective is to provide a flexible framework for the integration of data whose structure is graph-based (e.g., RDF). The idea is that the user has not to specify a join operation between fragments. The way the fragments can be combined is a discovery process and rests on a specific algorithm. We also led some experiments on synthetic datasets to demonstrate the effectiveness of this approach.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01353115
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Wednesday, August 10, 2016 - 4:23:08 PM
Last modification on : Tuesday, February 26, 2019 - 11:49:42 AM

Identifiers

Citation

Thanh-Huy Le, Haytham Elghazel, Mohand-Said Hacid. A Relational-Based Approach for Aggregated Search in Graph Databases. International Conference on Database Systems for Advanced Applications (DASFAA 2012), Apr 2012, Busan, South Korea. pp.33-47, ⟨10.1007/978-3-642-29038-1_5⟩. ⟨hal-01353115⟩

Share

Metrics

Record views

154