
Episode 417: Alex Petrov on Database Storage Engines
Software Engineering Radio - the podcast for professional software developers
00:00
The Binder Research Tree, Part 2: Splits and Merges
The binda research trees do in order to increase the capacity, they sort of append the note to the bottom most level, or wherever it fits. And then they rotate. So on each step you can append the node and make the tree sort of unbalanced by making one leg of the tree slightly longer than the other ones. But there are obviously no splits and merges in the binder research trees.
Transcript
Play full episode