Aggregated Search in Graph Databases: Preliminary Results

Aggregated Search in Graph Databases: Preliminary Results,10.1007/978-3-642-20844-7_10,Haytham Elghazel,Mohand-Said Hacid

Aggregated Search in Graph Databases: Preliminary Results   (Citations: 1)
BibTex | RIS | RefWorks Download
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.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: