R. Neubert and O. Görlitz (Germany)
Graph database, Index Structure, Exact Match Query,Bioinformatics
This paper describes the basic ideas behind a new in dex structure, the so-called Q-Tree, for indexing a set of labeled undirected graphs and speeding up exact-match graph queries to this set. Furthermore, its usefulness is shown by applying it to a graph database containing biomedical information about chemicals. This experiment is also used to compare the performance of the Q-Tree to another recently proposed index structure called Graph Grep.
Important Links:
Go Back
