Intro to database systems class: Consider the B+ tree index shown in the figure

Question

Intro to database systems class:

Consider the B+ tree index shown in the figure 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. Answer the following questions. Please show every step of the insertion and explain the process. Insert a record with search key 109 into the tree. Delete the record with search key 81 from the original tree.

Explanation / Answer

1)whenever 109 inserted.but actually it accomodates only 4 keys.so

first it searchs for correct location to place 109.correct location is L8: 98,99,100,105,109

but it can store only 4 keys.so,middle element got to up level.L3

90,98,100

and below level it is 98,99,105,109 L8

2)first we search for key 81.actually it is present at L6.so,we can simply delete it.then L6 contains only 82

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.