Re:LevelDB: A Fast Persistent Key-Value Store
by leif on Thursday July 28, 2011 @01:25AM
(#2815510)
Data structures which require a disk seek per random insert are obsolete. LevelDB is using a Log-Structured Merge Tree, one of many write-optimized data structures (but not the best).
[ Parent
| on HN ]
Re:LevelDB: A Fast Persistent Key-Value Store
by DanWaterworth on Thursday July 28, 2011 @02:20AM
(#2815626)
This link, comparing LSM trees with fractal trees, is quite interesting: http://www.quora.com/What-are-the-major-differences-between-...