1 Consider The B Tree Index Every Node Can Contain M Entries Where 2 M S 4 The Root Node Is An Exception It Al 1 (35.94 KiB) Viewed 51 times
1 Consider The B Tree Index Every Node Can Contain M Entries Where 2 M S 4 The Root Node Is An Exception It Al 2 (24.35 KiB) Viewed 51 times
1. Consider the B+ tree index. • Every node can contain m entries, where 2 ≤ m s 4. The root node is an exception: it allows 1 sms 4. • B+ tree H-14 K 6 14 18 16" 17" 21 23 25 31 26 28 30 34 35 36 40 A. Show the B+ tree that would result from inserting data entries with key 31, 32, and 41 into the tree. B. Given the output of (A), show the B+ tree that would result from deleting the data entry with key 3. C. Given the output of (B), show the B+ tree that would result from deleting the data entry with key 4. D. Given the output of (C), show the B+ tree that would result from deleting the data entry with key 15.
2. Consider the Linear Hashing index. Linear Hashing h1 000 001 010 011 ho 00 01 10 11 24* 40* Primary Page 9* 25* 37* 10* 14* 6* 26* 31* 7* 11* 35* A. Show the resulting index after inserting the entry 5* B. Show the resulting index after inserting the entry 3* C. Show the resulting index after inserting entry 23* D. Show the resulting index after inserting the entry 18* Overflow Page
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!