Question

Consider the database with the block size of 3 KB, data record pointer is 10 byte long, the value field is 20 bytes long and a block pointer is 9 bytes long. If the order of a leaf node in a $B^{+}$ tree is defined as the maximum number of (value, data record pointer) pair it can hold then the order of the leaf node is __________

Answer 1

102
P(keys + record pointer) + Block pointer $\le$ block size

$P(20+10)+9\le 3072$

$30P+9\le 3072$

$30P\le 3072-9$

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

P =102