Use Indexes
Closed this issue · 3 comments
Why not add some btree indexes on the keys so you don't have to manually look over ever line of the file for the key?
The current caching helps a little.
Can you provide some examples?
On 15 Jul 2013, at 21:28, David Pennington notifications@github.com wrote:
Why not add some btree indexes on the keys so you don't have to manually look over ever line of the file for the key?
The current caching helps a little.
—
Reply to this email directly or view it on GitHub.
Decided not to go with storing all keys in memory as an index to keep Flintstone memory efficient.
Actually, this has nothing to do with storing keys in memory - indexes have to do with key lookup. Right now you are storing values in memory with your cache setup.
Research BTrees to see how to find the exact piece of data you want without looping over every single line in a file.