4. Consider the structure of B+-tree introduced in the class. Each leaf/internal node of a B+-tree is physically stored

[answerhappygod]

4 Consider The Structure Of B Tree Introduced In The Class Each Leaf Internal Node Of A B Tree Is Physically Stored 1 (40.47 KiB) Viewed 35 times

4. Consider the structure of B+-tree introduced in the class. Each leaf/internal node of a B+-tree is physically stored on the disk as a block. Tuples are stored only on leaves while each internal node holds only interleaved key values and pointers: in each internal node, the # of points is always 1 more than the # of key values. For relation Student, each leaf node can accommodate up to two tuples; each internal node can hold up to 3 keys and 4 pointers. Relation Student is initially empty and its B+-tree has been constantly changing when the following 12 records with keys 37,2, 54, 50, 41, 58, 56, 19, 67, 69, 63, 21 are inserted sequentially to the relation. Please draw the snapshots of the B+-tree of Student after the insertion of 54, 58, 56 and 21, respectively. [12 marks]