C
Chris
I need a really simple, on-disk, read-only btree to hold a very large
amount of data. By "read-only" I mean that the tree will get populated
once, with keys that are already in order, written to disk, and then
queried. It will never be updated.
The sql databases out there have too much overhead and are too slow for
the type of access I need.
The functions I need are 1. initial population, 2. seek by (partial)
key, 3. iterate through keys/values in order.
Any suggestions?
amount of data. By "read-only" I mean that the tree will get populated
once, with keys that are already in order, written to disk, and then
queried. It will never be updated.
The sql databases out there have too much overhead and are too slow for
the type of access I need.
The functions I need are 1. initial population, 2. seek by (partial)
key, 3. iterate through keys/values in order.
Any suggestions?