2-3 Trees vs B-Trees

• 2-3 Trees have a disadvantage: They are memory based. The whole tree and all its data has to fit in core memory.

• Or does it?...

• B-Trees are used for storing large amounts of data. More than can fit in memory. And they are quite a lot like 2-3 Trees.