4 ms·
Kyoto TreeDB and SQLite both use a B+Tree/B-Tree implementation. As far as I remember LevelDB uses a Log-Structured Merge Tree. So this is basically a comparis
by rb2k_ 15y ago
Kyoto TreeDB and SQLite both use a B+Tree/B-Tree implementation. As far as I remember LevelDB uses a Log-Structured Merge Tree.
So this is basically a comparison between those, right?
Does a LSM offer ordered access or do you lose that feature and gain a bit of speed?
- snewman 15y agoLSMs support ordered access. The implementation performs an ordered scan on each .sst and merges the results.