In a database file, the search key field is 9 bytes long the block size is 512 bytes, a record pointer is 6 bytes and block pointer is 7 bytes. The largest possible order of a non leaf node in B+ tree implementing this file structure {order defines maximum number of keys present} is ______.
Solution
Asked Order of Internal Node:
Equation : order *( Block Ptr Size ) + ( order -1) Record Ptr Size < = Block Size
n(7)+ ( n-1) * 6 <= 512
13n <= 518
n <= 39.84
order = 39
Answer given as 31 .
How is this possible . Correct me if i am wrong