I think the use-cases are different here. This library is set up for write-once, then read-only access later. LevelDB is all about mutability. I think the use-cases here is for constant-time lookups on fixed-size data sets. LevelDB is a tree-based map, where this is a hashmap, which may give better performance for the author's purposes.
From the second paragraph:
My usage is mostly to build the hashtable once and then reuse it many times. Several design choices reflect this bias and so does performance. Building the hash table can take a while. A big (roughly 1 billion entries) table took almost 1 hour to build. This compares to about 10 minutes for building a Python hashtable of the same size.
From the second paragraph:
My usage is mostly to build the hashtable once and then reuse it many times. Several design choices reflect this bias and so does performance. Building the hash table can take a while. A big (roughly 1 billion entries) table took almost 1 hour to build. This compares to about 10 minutes for building a Python hashtable of the same size.