3 ms·
I've been staring to write a paper on bcache/bcachefs's b-tree design, which is also a sort of combination b-tree/trie (it uses binary trees in eytzinger layout
by koverstreet 8y ago
I've been staring to write a paper on bcache/bcachefs's b-tree design, which is also a sort of combination b-tree/trie (it uses binary trees in eytzinger layout). Pretty cool to see the same idea coming up in multiple places.
Running index-microbenchmarks now to see which is faster :)
- equalunique 8y agoGood luck! Hopefully more will join your Patreon to assist in making that happen.
- koverstreet 8y agoWith what appears to be the current version of masstree: https://github.com/kohler/masstree-beta https://github.com/kohler/masstree-beta Single threaded random lookups: 1.4M/sec for bcachefs, 2M/sec for masstree.