Problem
Consider a Student table with the primary key studentId and several other columns including studentState.
Logical Record Size: 80 bytes
Total Number of Logical Record: 262144 (2^18) bytes
Key Size: 8 bytes
Pointer Size: 8 bytes
Physical Record Size: 2048 (2^11) bytes
Answer the following questions according to the data. Show formulas that you used to perform the calculations.
• Consider a B-tree for the primary key studentId column in the Student table. Recall that the B-tree nodes contain keys and pointers (but the entire logical records). Calculate the maximum number of keys in a B-tree node.
• Calculate the minimum depth of a B-tree on the primary key studentId column in the Student table. Assume that the B-tree index must contain all keys present in the data table.