Bf-Tree: modern read-write-optimized concurrent larger-than-memory range index
25 points
2 hours ago
| 2 comments
| github.com
| HN
algorithmsRcool
19 minutes ago
[-]
I get excited every time I see a paper from Bradish. I've learned so much about high performance software from studying systems that he has worked on. (not to diminish his many co-authors and contributors)

Some of his other projects:

[0] https://github.com/microsoft/garnet [1] https://github.com/microsoft/FASTER [2] https://github.com/microsoft/Trill

reply
0xdeafbeef
35 minutes ago
[-]
I've tested with wal enabled, got deadlock several times, so looks raw for now
reply
heliumtera
23 minutes ago
[-]
I think a fair comparison would be against a whitepaper? Clearly this is an exploratory venture and not production grade software.

You managed to clone the repo an run your test by yourself, whatever the outcome is this is a plus against the standard model for scientific research.

Also, a breath of fresh air among every other show HN thread using hundreds of adjectives to describe the "behavior" of a fully vibed system. I think this is a good model for presenting engineering projects.

reply
SchwKatze
17 minutes ago
[-]
> You managed to clone the repo an run your test by yourself, whatever the outcome is this is a plus against the standard model for scientific research.

That's so true, which is kinda funny since one of the cornerstone of scientific thinking is reproducibility.

IMHO they're using the best tool for this, nix.

reply