1 / 14

Insertion in a B+ Tree

Insertion in a B+ Tree. Insert: 8. 8. Insertion in a B+ Tree. Insert: 5. 5. 8. Insertion in a B+ Tree. Overflow – create a new level. Insert: 1. 5. 1. 5. 8. Insertion in a B+ Tree. Insert: 7. 5. 1. 5. 7. 8. Insertion in a B+ Tree. Overflow - Split. Insert: 3. 3. 5. 1. 3.

nash
Télécharger la présentation

Insertion in a B+ Tree

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Insertion in a B+ Tree Insert: 8

  2. 8 Insertion in a B+ Tree Insert: 5

  3. 5 8 Insertion in a B+ Tree Overflow – create a new level Insert: 1

  4. 5 1 5 8 Insertion in a B+ Tree Insert: 7

  5. 5 1 5 7 8 Insertion in a B+ Tree Overflow - Split Insert: 3

  6. 3 5 1 3 5 7 8 Insertion in a B+ Tree Overflow - Split Propagates to a new level Insert: 12

  7. 5 8 3 12 1 3 5 7 8 Insertion in a B+ Tree Insert: 9

  8. 5 8 3 1 3 5 7 8 9 12 Insertion in a B+ Tree Overflow – Split Insert: 6

  9. 5 3 7 8 1 3 5 6 7 8 9 12 Insertion in a B+ Tree Resulting B+-tree

  10. 9 7 1 6 12 1 5 6 7 8 9 Deletion in a B+-Tree Delete: 5

  11. 9 7 1 6 12 1 7 8 9 6 Deletion in a B+-Tree Underflow - redistribute Delete: 12

  12. 8 7 1 6 1 7 6 9 8 Deletion in a B+-Tree Delete: 9

  13. 8 7 1 6 1 7 6 8 Deletion in a B+-Tree Underflow merge with the left propagate reduce the tree levels

  14. 1 6 1 6 7 8 Deletion in a B+-Tree

More Related