1 / 27

B + -Trees

B + -Trees. Same structure as B-trees. Dictionary pairs are in leaves only. Leaves form a doubly-linked list. Remaining nodes have following structure:. j a 0 k 1 a 1 k 2 a 2 … k j a j. j = number of keys in node. a i is a pointer to a subtree.

paiva
Télécharger la présentation

B + -Trees

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. B+-Trees • Same structure as B-trees. • Dictionary pairs are in leaves only. Leaves form a doubly-linked list. • Remaining nodes have following structure: j a0 k1 a1 k2 a2 …kj aj • j =number of keys in node. • aiis a pointer to a subtree. • ki <= smallest key in subtreeai and>largest inai-1.

  2. Example B+-tree 9 5 16 30 1 3 5 6 9 30 40 16 17  index node  leaf/data node

  3. B+-tree—Search 9 5 16 30 1 3 5 6 9 30 40 16 17 key = 5 6 <= key <= 20

  4. B+-tree—Insert 9 5 16 30 1 5 6 9 30 40 16 17 Insert 10

  5. Insert 9 5 16 30 1 3 5 6 9 30 40 16 17 • Insert a pair with key = 2. • New pair goes into a 3-node.

  6. 2 3 1 2 3 2 3 1 1 2 Insert Into A 3-node • Insert new pair so that the keys are in ascending order. • Split into two nodes. • Insert smallest key in new node and pointer to this new node into parent.

  7. Insert 9 5 2 16 30 2 3 1 5 6 9 30 40 16 17 • Insert an index entry 2plus a pointer into parent.

  8. 9 2 5 16 30 1 2 3 5 6 9 30 40 16 17 Insert • Now, insert a pair with key = 18.

  9. Insert 9 17 2 5 16 30 17 18 1 2 3 5 6 9 16 30 40 • Now, insert a pair with key = 18. • Insert an index entry17plus a pointer into parent.

  10. Insert 17 9 2 5 16 30 1 2 3 5 6 9 16 17 18 30 40 • Now, insert a pair with key = 18. • Insert an index entry17plus a pointer into parent.

  11. Insert 9 17 2 5 16 30 1 2 3 5 6 9 16 17 18 30 40 • Now, insert a pair with key = 7.

  12. 9 2 5 16 30 1 2 3 5 6 9 30 40 16 17 Delete • Delete pair with key = 16. • Note: delete pair is always in a leaf.

  13. Delete 9 2 5 16 30 1 2 3 5 6 9 17 30 40 • Delete pair with key = 16. • Note: delete pair is always in a leaf.

  14. Delete 9 2 5 16 30 1 2 3 5 6 9 17 30 40 • Delete pair with key = 1. • Get >= 1from adjacent sibling and update parent key.

  15. Delete 9 3 5 16 30 2 3 5 6 9 17 30 40 • Delete pair with key = 1. • Get >= 1from sibling and update parent key.

  16. Delete 9 3 5 16 30 2 3 5 6 9 17 30 40 • Delete pair with key = 2. • Merge with sibling, delete in-between key in parent.

  17. Delete 9 5 16 30 3 9 17 30 40 5 6 • Delete pair with key = 3. • Get >= 1from sibling and update parent key.

  18. Delete 9 6 16 30 5 6 9 17 30 40 • Delete pair with key = 9. • Merge with sibling, delete in-between key in parent.

  19. Delete 9 6 30 30 40 17 5 6

  20. Delete 9 6 16 30 5 6 9 17 30 40 • Delete pair with key = 6. • Merge with sibling, delete in-between key in parent.

  21. Delete 9 16 30 5 9 17 30 40 • Index node becomes deficient. • Get >= 1from sibling, move last one to parent, get parent key.

  22. Delete 16 9 30 5 17 30 40 9 • Delete 9. • Merge with sibling, delete in-between key in parent.

  23. Delete 16 30 5 17 30 40 • Index node becomes deficient. • Merge with sibling and in-between key in parent.

  24. Delete 16 30 17 30 40 5 • Index node becomes deficient. • It’s the root; discard.

  25. B*-Trees • Root has between 2 and 2 * floor((2m – 2)/3) + 1 children. • Remaining nodes have between ceil((2m – 1)/3)andm children. • All external/failure nodes are on the same level.

  26. Insert • When insert node is overfull, check adjacent sibling. • If adjacent sibling is not full, move a dictionary pair from overfull node, via parent, to nonfull adjacent sibling. • If adjacent sibling is full, split overfull node, adjacent full node, and in-between pair from parent to get three nodes with floor((2m – 2)/3),floor((2m – 1)/3), floor(2m/3) pairs plus two additional pairs for insertion into parent.

  27. Delete • When combining, must combine 3 adjacent nodes and 2 in-between pairs from parent. • Total # pairs involved = 2 * floor((2m-2)/3) + [floor((2m-2)/3) – 1] + 2. • Equals3 * floor((2m-2)/3) + 1. • Combining yields2nodes and a pair that is to be inserted into the parent. • m mod 3 = 1=>nodes havem – 1pairs each. • m mod 3 = 0 => one node hasm – 1pairs andthe other hasm – 2. • m mod 3 = 2=> nodes havem – 2pairs each.

More Related