Question

The order of a leaf node in a B+ tree is the maximum number of (value, record pointer ) pairs it can hold. Given that the block size is 1024 bytes, record pointer is 9 byte long, the value field is 13 bytes long and block pointer is 8 bytes long. The order of the leaf node is _____.

Answer 1

Let order of the leaf node is n.
Block size = 1024 byte.
$(9+13)n+8\le 1024$\
$22n+8\le 1024$
$22n\le 1016$
$n\le 46.18$
n = 46

Oreder of leaf node is 46.