Title :
CT-index: Fingerprint-based graph indexing combining cycles and trees
Author :
Klein, Karsten ; Kriege, Nils ; Mutzel, Petra
Author_Institution :
Dept. of Comput. Sci., Tech. Univ. Dortmund, Dortmund, Germany
Abstract :
Efficient subgraph queries in large databases are a time-critical task in many application areas as e.g. biology or chemistry, where biological networks or chemical compounds are modeled as graphs. The NP-completeness of the underlying subgraph isomorphism problem renders an exact subgraph test for each database graph infeasible. Therefore efficient methods have to be found that avoid most of these tests but still allow to identify all graphs containing the query pattern. We propose a new approach based on the filter-verification paradigm, using a new hash-key fingerprint technique with a combination of tree and cycle features for filtering and a new subgraph isomorphism test for verification. Our approach is able to cope with edge and vertex labels and also allows to use wild card patterns for the search. We present an experimental comparison of our approach with state-of-the-art methods using a benchmark set of both real world and generated graph instances that shows its practicability. Our approach is implemented as part of the Scaffold Hunter software, a tool for the visual analysis of chemical compound databases.
Keywords :
data visualisation; database indexing; fingerprint identification; graph theory; optimisation; query processing; trees (mathematics); very large databases; CT-Index; NP-completeness; Scaffold Hunter software; cycle features; edge labels; filter-verification paradigm; fingerprint-based graph indexing; hash-key fingerprint technique; large databases; subgraph isomorphism problem; subgraph queries; time-critical task; trees; vertex labels; visual analysis; wild card patterns; Biology; Chemical compounds; Encoding; Feature extraction; Indexing;
Conference_Titel :
Data Engineering (ICDE), 2011 IEEE 27th International Conference on
Conference_Location :
Hannover
Print_ISBN :
978-1-4244-8959-6
Electronic_ISBN :
1063-6382
DOI :
10.1109/ICDE.2011.5767909