Consider the B+ tree in Figure 14.13 from the course textbook (Page 636). Descri

Question

Consider the B+ tree in Figure 14.13 from the course textbook (Page 636). Describe how each of the following operations would proceed. If it modifies the tree, draw the revised tree. Assume that an insert that does not find space in its node will trigger a splitting of this node. You can make additional assumptions, but you must always spell them out. 1. Lookup record with search key 35. Indicate which index pages are accessed? Write them in the order of their access. E.g., label each index node with a label like "N1", "N2", ..., and the specify the sequence of touched nodes to search for key 35. the range 19, 211 Indicate which 2. Lookup all records with search key in the range [9, 21]. Indicate which index pages are accessed? As in (1) Write them in the order of their access. 3. Insert a record with key 4. Show the modified tree. To the tree after the above insertion, insert record with key 14, then record with key 15, then record with key 16. Show the tree after every insert. 4. Write them in the order of their access. 6. Delete the record with key 23. Show the modified tree

Explanation / Answer

Answer 1):

Searched indices for 35: 0, 2, and 11

Answer 2):

Searched indices for 9: 0, 1, and 6

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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