News for hackers. Stuff that matters.
Re:LevelDB Benchmarks by rb2k_ on Wednesday July 27, 2011 @03:43PM (#2813775)
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?

Re:LevelDB Benchmarks by snewman on Wednesday July 27, 2011 @04:29PM (#2813965)
LSMs support ordered access. The implementation performs an ordered scan on each .sst and merges the results.