Question: 1.a) A B+-tree is to be stored on disk whose block size is 2048 bytes. The data records to be stored are 64 bytes, and
1.a) A B+-tree is to be stored on disk whose block size is 2048 bytes. The data records to be stored are 64 bytes, and their key is 24 bytes. Determine the values for M and L for the B+-tree. Assume pointers are 4 bytes each.
b) From a), in the worst case, how many levels are needed to store 16,000,000 records?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
