B-trees are a type of self balancing search tree where each node can hold multiple keys and all leaf nodes are the same distance from the root.

- Stackoverflow.com Wiki
2 articles, 0 books.

How do you search for a value quickly? Create an index. What do you have to remember to do when joining two tables together? Create an index. How do you speed up a SQL statement that’s beginning to run slowly? Create an index. But what are indexes, exactly? And how do they speed up our database searches?


The absolute worst thing about B+Trees is their name. It is like someone maliciously considered all the possible names and then selected the most confusing one.