A Relational-Based Approach for Aggregated Search in Graph Databases - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

A Relational-Based Approach for Aggregated Search in Graph Databases

Résumé

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.
Fichier non déposé

Dates et versions

hal-01353115 , version 1 (10-08-2016)

Identifiants

Citer

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⟩
97 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More