GATE | GATE IT 2006 | Question 61

In a database file structure, the search key field is 9 bytes long, the block size is 512 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a non-leaf node in a B+ tree implementing this file structure is
(A) 23
(B) 24
(C) 34
(D) 44

Answer: (C)

Explanation: For B+ tree with order n, index pointer p, and block size = B
For a non leaf node it can be given that
n*p + (n-1)*(k) <= B
n*6 + (n-1)*9 <= 512
n <= 34.77

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.