Somebody on FMS has built an efficient search index. This compares to the many gigabytes of the Library/Spider combination. On the other hand his structure doesn't scale, and will eventually run into collisions. Thoughts?
Compression helps with Spider/Library, but evidently not enough - it's a lot of keys and takes a long time to insert. Just how much leverage do you get from an efficient binary data structure?
