Question

Question 3. (25 points) Consider the B+ tree index shown below. Each intermediate node can hold up to five pointers and four key values. Each leaf can hold up to four records, and leaf nodes are doubly linked as usual, although these links are not shown in the figure. If you can borrow from or merge with both siblings, choose the right sibling. Answer the following questions 3080 I1 35425065 9098 12 68 69 70 79 98 99 1001105 30 31 Li LS L8 36 38 51 5256 60 94 95 96 97 し7 L2 L4 81 82 42 43 L3 L6 Name all the tree nodes that must be fetched to answer the following query: "Get all records with a) search key greater than 38." b) Show the B+ tree that would result from inserting a record with search key 90 into the tree c) Show the B+ tree that would result from deleting the record with search key 38 from the original tree

Answer 1

UeSliOn 3 neb oll tccor than 38 42,43, 5o, 5i 1,56, Go, 65, 68, 69,70, 9 »0. 3, g2,9o,94,95, 76,7, 18, 29, o 1o16 172 42 43 ing a rccold w

60 2013 Sl