News for hackers. Stuff that matters.
Re:How the append-only btree works by slashdev on Friday December 29, 2023 @11:57AM (#38807174)
LMDB is a strong counter-example to your argument. Based on its benchmarks, you're wrong. [1]

Yes immutable in-memory data structures are slower than their mutable counterpoints, but we're not talking about either of those here.

Databases are not in-memory data structures.

[1] http://www.lmdb.tech/bench/microbench/july/

There are no comments on this comment yet.