Re:Bf-Tree: modern read-write-optimized concurrent larger-th...
by dacapoday on Thursday January 29, 2026 @02:26AM
(#46806912)
Why not add an LSM memtable on top of the cow b+ tree?
Use the skiplist as a write buffer and write to the b+ tree in batches when the skiplist is frozen.
[ Parent
| on HN ]
Re:Bf-Tree: modern read-write-optimized concurrent larger-th...
by 0xdeafbeef on Thursday January 29, 2026 @03:14AM
(#46807215)
Bftree solves one non-obvious pain point - caching when your data set is random (the key is a hash) and the data is smaller than the page size. LSM reads are based on block size; same with caching. So if your record is 8 bytes, you end up caching the remaining ~4 KB, and the hit rate will be pretty low.