This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 94 Chapter 10 Root 17 24 30 2* 3* 5* 7* 14* 16* 19* 20* 22* 24* 27* 29* 33* 34* 38* 39* 13 Figure 10.11 Tree for Exercise 10.5 a static index which reserves enough space for all possible future inserts. Also if the system goes periodically off line, static indices can be rebuilt and scaled to the current occupancy of the index. Infrequent or scheduled updates are ags for when to consider a static index structure. Exercise 10.4 Suppose that a page can contain at most four data values and that all data values are integers. Using only B+ trees of order 2, give examples of each of the following: 1. A B+ tree whose height changes from 2 to 3 when the value 25 is inserted. Show your structure before and after the insertion. 2. A B+ tree in which the deletion of the value 25 leads to a redistribution. Show your structure before and after the deletion. 3. A B+ tree in which the deletion of the value 25 causes a merge of two nodes but without altering the height of the tree. 4. An ISAM structure with four buckets, none of which has an overow page. Fur- ther, every bucket has space for exactly one more entry. Show your structure before and after inserting two additional values, chosen so that an overow page is created. Answer 10.4 Answer omitted. Exercise 10.5 Consider the B+ tree shown in Figure 10.11. 1. Identify a list of five data entries such that: (a) Inserting the entries in the order shown and then deleting them in the op- posite order (e.g., insert a , insert b , delete b , delete a ) results in the original tree. Tree-Structured Indexing 95 (b) Inserting the entries in the order shown and then deleting them in the op-...
View Full Document
- Fall '12