News for hackers. Stuff that matters.
Re:How the append-only btree works by hyc_symas on Thursday January 04, 2024 @11:49PM (#38875800)
There's an obvious tradeoff. With a 4K page size, the breakeven point is around 768 bytes per record. For larger records, the WAL approach is less efficient than LMDB. For smaller records, the WAL is more efficient in terms of write amplification. All thoroughly explored here http://www.lmdb.tech/bench/ondisk/

There are no comments on this comment yet.