Aggregated Search in Graph Databases: Preliminary Results - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Aggregated Search in Graph Databases: Preliminary Results

Haytham Elghazel
Mohand-Said Hacid


Graphs are widely used to model complicated data semantics in many applications (e.g. spacial databases, image databases,…). Querying graph databases is costly since it involves subgraph isomorphism testing, which is an NP-complete problem [7]. Most of the existing query processing techniques are based on the framework of filtering-and-verification to reduce computation costs. However, to the best f our knowledge, the problem of assembling graphs to provide an answer to a given query graph (i.e. information need) if it is not present in one single source, is not investigated. In this paper, we try to highlight the potential and the motivation that lies behind the graph aggregation query problem. We propose a first approach to support aggregated search in graph databases. We discuss the preliminary results from the algorithmic point of view.

Dates and versions

hal-01354546 , version 1 (18-08-2016)



Haytham Elghazel, Mohand-Said Hacid. Aggregated Search in Graph Databases: Preliminary Results. Graph-Based Representations in Pattern Recognition - 8th IAPR-TC-15 International Workshop (GbRPR 2011), May 2011, Münster, Germany. pp.92-101, ⟨10.1007/978-3-642-20844-7_10⟩. ⟨hal-01354546⟩
51 View
0 Download



Gmail Facebook Twitter LinkedIn More