In B+ tree each key is stored in a leaf node. So, the order of leaf node in B+ tree is the maximum number of (key, record pointer)pairs it can hold. What is the order of B+ tree leaf node, when block size is given as 4 Kilo byte record pointer(RP) of 8 byte, block pointer(BP) size is 2 byte and key is of 15 byte.
Explanation: Let order of leaf node of B+ tree is p,
p*(key + Rp) + Bp ≤ Block size p(15 + 8) + 2 ≤ 4 * 1024 23*p ≤ 4096-2 p ≤ 4094 / 23 P ≤ 178
So, option (B) is correct.
Quiz of this Question