B-trees EASY

1. A B+ tree structure is generally superior to a B-tree for indexed sequential access. Since B+ trees incorporate B trees, why not use a B+ trees whenever a hierarchical indexed structure is called for? 2. Consider the sequence set shown in Fig. 10.1(b). Show the sequence set after the keys DOVER and EARNEST are added; then show the sequence set after the key DAVIS is deleted. Did you use concatenation or redistribution for handling the overflow? 3. If the key BOLEN in the simple prefix B+ tree in Fig. 10.7 is deleted from the sequence set node, how is the separator BO in the parent node affected? 4. Consider the simple prefix B+ tree shown in Fig. 10.7. Suppose a key added to block 5 results in a split of block 5 and the consequent addition of block 8, so block 5 and 8 appears as follows: ? -> FABER-FINGER -> FINLEY-FOLK -> ? 5 5 8 a. What does the tree look like after the insertion? b. Suppose that, subsequent to the insertion, a deletion causes underflow and the consequent concatenation of the block 4 and 5. What does the tree look like after the deletion? c. Describe a case in which a deletion results in redistribution rather than concatenation, and show the effect it has on the tree. 5. Why it is often a good idea to use the same block size for the index set and the sequence set in a simple prefix B+ tree? Why should the index set nodes and the sequence set nodes usually be kept in the same file? ## Deliverables I NEED THIS IMMEDIATELY. PLEASE JUST ATTACH WORK WHEN YOU MAKE BID. THIS MUST BE TURNED IN BY 10AM SATURDAY 4/13 EASTERN STANDARD TIME. ## Platform microsoft word.