Here is a B+ tree. The order p_i of the internal nodes is 3. This means...

 

Transcribed Image Text:

Here is a B+ tree. The order p_i of the internal nodes is 3. This means that internal nodes will contain up to 2 search values and 3 pointers. The order p_leaf of the leaf nodes is also 3. This means that a leaf node can contain up to 3 data values and 3 pointers to database blocks. For both internal and leaf nodes, the value j, which determines how you split the node, will be 2, In other words, if a leaf node must be split, you will put the first two values in the old node, and the rest of the values in the new node. If you need to split an internal node, you will copy the 2nd search value up to the node above it. 15 10 15 33 a. Show what the tree looks like after inserting 2. b. Show what the tree resulting from a looks like after inserting 14 c. Show what the tree resulting from b looks like after inserting 13. Here is a B+ tree. The order p_i of the internal nodes is 3. This means that internal nodes will contain up to 2 search values and 3 pointers. The order p_leaf of the leaf nodes is also 3. This means that a leaf node can contain up to 3 data values and 3 pointers to database blocks. For both internal and leaf nodes, the value j, which determines how you split the node, will be 2, In other words, if a leaf node must be split, you will put the first two values in the old node, and the rest of the values in the new node. If you need to split an internal node, you will copy the 2nd search value up to the node above it. 15 10 15 33 a. Show what the tree looks like after inserting 2. b. Show what the tree resulting from a looks like after inserting 14 c. Show what the tree resulting from b looks like after inserting 13.