B-Tree Reinvention Debate
Discussions center on whether a new data structure is reinventing B-trees, with comparisons of performance, cache efficiency, and alternatives like crit-bit trees or balanced binary trees in in-memory and database contexts.
Activity Over Time
Top Contributors
Keywords
Sample Comments
Did they try a B-tree and found it to be slower?
Sounds like we're just reinventing B-trees.
This type of data structure ought to have much better cache and branch prediction behaviour than most tree implementations.
B-tree would be faster than either
Did they just reinvent B trees?
More reading: https://www.chiark.greenend.org.uk/~sgtatham/tweak/btree.htm...
Any idea why is it not using B-trees?
It's been a while since I last tried things, but I found crit-bit trees[1] to be much faster than b-trees. Hash array-mapped tries are also good if you don't need the things that trees give you (e.g. in-order traversal, get all values in a certain range).1: https://cr.yp.to/critbit.html
how often does a normal software developer find himself in a situation where he has to know about B-Trees in depth?
How are these better than balanced binary trees that keep subtree size in the node?