Aggregated Search in Graph Databases: Preliminary Results

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.

[1]  Peter Willett,et al.  Maximum common subgraph isomorphism algorithms for the matching of chemical structures , 2002, J. Comput. Aided Mol. Des..

[2]  Philip S. Yu,et al.  Graph Indexing: Tree + Delta >= Graph , 2007, VLDB.

[3]  Philip S. Yu,et al.  Graph indexing: a frequent structure-based approach , 2004, SIGMOD '04.

[4]  Philip S. Yu,et al.  Substructure similarity search in graph databases , 2005, SIGMOD '05.

[5]  Shijie Zhang,et al.  TreePi: A Novel Graph Indexing Method , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[6]  Wilfred Ng,et al.  Fg-index: towards verification-free query processing on graph databases , 2007, SIGMOD '07.

[7]  Jeffrey Xu Yu,et al.  Taming verification hardness: an efficient algorithm for testing subgraph isomorphism , 2008, Proc. VLDB Endow..

[8]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[9]  Dennis Shasha,et al.  Algorithmics and applications of tree and graph searching , 2002, PODS.

[10]  Thorsten Meinl,et al.  Graph-Based Procedural Abstraction , 2008, International Symposium on Code Generation and Optimization (CGO'07).

[11]  Dennis Shasha,et al.  GraphGrep: A fast and universal method for querying graphs , 2002, Object recognition supported by user interaction for service robots.

[12]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[13]  Janez Konc,et al.  An improved branch and bound algorithm for the maximum clique problem , 2007 .