Question

Consider a $B^{+}$ tree in which search key 20 bytes long, block size is 1500 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each leaf node of the tree is _______

Answer 1

49
Assume order of leaf node is P
In $B^{+}$ tree,
P*Key Size +P* Record Pointer +Block Pointer $\le$ Block size
P*20 + P* 10 + 8 $\le$ 1500
30 P $\le$ 1492

$P\le \left[\frac{1492}{30}\right]$

$P\le 49$