Hacker News Reader

It would be great to see a walkthrough writing a minimal btree from scratch with reading/writing from disk.

If you've got one (walkthrough with code, not just an existing implementation), link it please!

This incomplete tutorial is about how to write a sqlite clone, with particular emphasis on how to implement the underlying b-tree: https://cstack.github.io/db_tutorial/

for YEARS that tutorial has been stuck on "Alright. One more step toward a fully-operational btree implementation. The next step should be splitting internal nodes. Until then!". Must not be worth the time to finish writing the tutorial.

I just implemented one in go, working on the repl now. I plan to eventually write it in C++ for a real database, but I’m doing this for my team to teach them the difference between LSM trees and Btrees. I’m hoping to show that a specialized concurrent btree, though harder to write, performs better than LSM trees for the same data. Maybe I’ll make a blog post about it.

EDIT: For more context, this is for time series metrics, so super specialized data.

I'd be interested in that blog post for sure.

Reply on news.ycombinator.com