SILT: A Memory-Efficient, High-Performance Key-Value Store [pdf](cs.cmu.edu)
cs.cmu.edu
SILT: A Memory-Efficient, High-Performance Key-Value Store [pdf]
https://www.cs.cmu.edu/~hl/papers/silt-sosp2011.pdf
7 comments
Meta: it might be worth updating the title to mention this was published in 2011.
Source code: https://github.com/silt/silt
How does it compare with LMDB?
LMDB is a fundamentally different design. Basically memory mapped B+ tree.
SILT is more algorithmicly comparable to Rocks/LevelDB. Data ages and is transformed into more and more compacted storage.
SILT is more algorithmicly comparable to Rocks/LevelDB. Data ages and is transformed into more and more compacted storage.
I would love to know the design and performance difference between this and redis.