Dark Mode

1,136 views

2 votes

In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is ________.

I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?

I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?

0

Order for a node is the maximum number of pointers that the node contains.

Here, in a B+ tree, leaf node has say p pairs of key and data pointers and one block pointer.

p(key + data pointer) + block pointer <= block size

p(9+7) + 6 <= 1024

p<=1018/16=63.xyz

Thus p=63...........Hence **Order of leaf node= Number of Pointers( Data + Block)= 63 +1= 64**

@srestha @souravsaha @mohitbawankar...... I think the answer 64 is correct.

Kindly correct if I am wrong.

0