i don’t get it. what’s next, visual bubble sort?
Let’s Invent B(+)-Trees
71–72 of 72 posts
Re: Let’s Invent B(+)-Trees
#72Earlier quoted context omitted.
I like the concept of persistent B-tree, can you share about the storage mechanism?
persistent (for both senses of the word) b-trees are used extensively in couchdb. You can read about their design here: https://guide.couchdb.org/draft/btree.html
I know quite a number of 'production grade' databases are using B-Tree internally, even mysql. I'm more interested on tiny implementation that just map the tree into the harddisk, without other complex features.