Figure 9
From: A tree-based method for the rapid screening of chemical fingerprints
Average space consumption, different database size. The memory consumption of the data structure for different strategies tested with k = 1, ..., 4. The three graphs (a) - (c) show the performance of the three bucket types for the different values of k. The k yielding the fastest query time for each method is presented in graph (d) along with the simple linear search results and Baldi.