A Relational-Based Approach for Aggregated Search in Graph Databases
| 详细信息 | 推荐本文 | |
- 作者：Thanh-Huy Le (1) thanhhuy27@gmail.com
Haytham Elghazel (2) haytham.elghazel@univ-lyon1.fr
Mohand-Sa铆d Hacid (1) mohand-said.hacid@univ-lyon1.fr - 关键词：graph databases – ; relational databases – ; query processing – ; aggregated search
- 刊名：Lecture Notes in Computer Science
- 出版时间：2012
- 出版年：2012
- 期刊代码：99_0302-9743
- 类别：cp
- 卷：7238
- 期：1
- 页码：33-47
- 数据来源：sp
摘要
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.