Table 5.
Query Time and Resident Memory for Mantis Using the Minimum Spanning Tree-Based Representation for Color Information and the Original Mantis (Using Ramen, Ramen, Rao-Compressed Color Classes) Over 10,000 Experiments
| Mantis with MST |
Mantis |
|||||
|---|---|---|---|---|---|---|
| Index load+query | Query | Space | Index load+query | Query | Space | |
| 10 Transcripts | 1 minute 10 seconds | 0.3 seconds | 118 GB | 32 minutes 59 seconds | 0.5 seconds | 290 GB |
| 100 Transcripts | 1 minute 17 seconds | 8 seconds | 119 GB | 34 minutes 33 seconds | 11 seconds | 290 GB |
| 1000 Transcripts | 2 minute 29 seconds | 79 seconds | 120 GB | 46 minutes 4 seconds | 80 seconds | 290 GB |
The “query” column provides just the time taken to execute all queries (as would be required if the index was already loaded in e.g., a server-based search tool). Note that, in resident memory usage for the MST-based representation, the counting quotient filter always dominates the total required memory.