B⁺ Trees

---

Below is a simple prefix B⁺ tree from a previous slide.


A plain B⁺ tree does not involve the use of prefixes as separators. Instead, the separators in the index set are simply copies of the actual keys. The operations performed on B⁺ trees are essentially the same as those discussed for simple prefix B⁺ trees.