Question: Question 5 A disk block contains 512 bytes. The search key, record pointer and page pointer occupy 8 bytes, 6 bytes and 4 bytes, respectively.

Question 5 A disk block contains 512 bytes. The search key, record pointer and page pointer occupy 8 bytes, 6 bytes and 4 bytes, respectively. Data entries use Alternative (2). A leaf node in B+-tree has a "previous-leaf pointer" and a "next-leaf-pointer". 1) Compute the order d of the B*-tree. Note that the order for leaf nodes and index nodes may be different. 2) Given the above parameters, what is the minimum number of data records that a 2-level B+-tree (not counting the root) can index. 3) Given the above parameters, what is the maximum number of data records that a 2-level B+-tree (not counting the root) can index
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
