Figure 5
From: GraphFind: enhancing graph searching by low support data mining techniques
Running time of approximate queries on a molecules database. The database contains 8000 molecules, it is available at [13]. Nodes labeled with a special wildcard symbol “?” can match any label; a wavy segment indicates an approximate path of any length (here the wildcard “*” representing an approximate path has been substituted with a wavy segment only for a graphical purpose). Query Q1 searches for a node (atom) C and a node N connected through a path. Query Q2 searches for a node (atom) C and a node N connected through a single node. As expected, the number of occurrences of Q1 is greater than those of Q2. In each graph, a query may have a large number of occurrences (in 27 candidate graphs, Q3 has 5372 matches).