edited by
1,596 views
2 votes
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?
edited by

2 Answers

0 votes
0 votes

 

Disk Block size = 1024 bytes
  
Data Record Pointer size, r = 7 bytes
Value size, v = 9 bytes
Disk Block ptr, P = 6 bytes

o(r + v) + p <= 1024
16o <= 1018
o =< 63

So Ans will be 63.

0 votes
0 votes
it is talking about leaf node just coz they didnt say anything and the value for record pointer is given .

so if u are suppose to consider it for and try to solve it then u will definately get the answer as 64 .

Related questions

2 votes
2 votes
1 answer
1
2 votes
2 votes
2 answers
2
nish kim asked Jan 19, 2018
1,265 views
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for...
2 votes
2 votes
1 answer
3