Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on How the append-only btree works. Parent comment
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.
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/