Consider a relation ? with one attribute ?. Suppose you have to insert the following A = {15, 19, 12, 82, 54, 53, 95, 84, 31, 41, 35} into the relation ?. Construct a B+-tree on the attribute ? of ?. Following the pseudocode of B+-tree given in the textbook (or the slides in ch11.ppt), construct a B+-tree with ? = 4. Assume that the B+-tree is initially empty. (1) Given A, insert the key values in such an order, and show the B+-tree after every insertion. (2) Given the B+-tree constructed in the step (1), show how the B+-tree is changed step-by-step following the pseudo-code when the key value “15” is deleted. (3)Given the B+-tree constructed in the step (2), show how the B+-tree is changed step-by-step following the pseudo-code when the key value “84” is deleted. (4) Given the B+-tree constructed in the step (2), show how the B+-tree is changed step-by-step following the pseudo-code when the key value “54” is deleted.
Consider a relation ? with one attribute ?. Suppose you have to insert the following A = {15, 19, 12, 82, 54, 53, 95, 84, 31, 41, 35} into the relation ?. Construct a B+-tree on the attribute ? of ?. Following the pseudocode of B+-tree given in the textbook (or the slides in ch11.ppt), construct a B+-tree with ? = 4. Assume that the B+-tree is initially empty.
(1) Given A, insert the key values in such an order, and show the B+-tree after every insertion.
(2) Given the B+-tree constructed in the step (1), show how the B+-tree is changed step-by-step following the pseudo-code when the key value “15” is deleted.
(3)Given the B+-tree constructed in the step (2), show how the B+-tree is changed step-by-step following the pseudo-code when the key value “84” is deleted.
(4) Given the B+-tree constructed in the step (2), show how the B+-tree is changed step-by-step following the pseudo-code when the key value “54” is deleted.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images
