LSM-Tree
LSM-Tree copied to clipboard
chrislessard
An implementation of an LSM Tree in Python
I have some proposition how to achieve parallelism, if you are still interested in iterating this lib: Essentially, we could allow each worker / thread have their own memtable and...
When the index and bloom filter fail, it would be smart to leverage the sorted nature of the SSTables to perform a binary search for the key in question on...
If the system crashes, there isn't a good way of backing up the bloom filter. Because it is checked to see if values are on disk, this could lead to...
It would be good if there was a way to make sure the bloom filter doesn't need to be reset whenever its parameters change
In the function `flush_memtable_to_disk`, I believe that the log needs to be added first before adding key value node to the bloom filter and index. - If there is a...
append log should be written to disk, which could ensure crash safe!
