Suppose size of disk block 1000 bytes and search key of 12 bytes, pointer size 8 bytes. How many minimum number of records in data file which leads 3 level dense B+ tree index?
My Approach:-
Say P is the Order. and we know In dense index the number of records in DB file = No. of keys in B+tree index
P*8 + (P-1)*12 <= 1200
P = 50
Now
Level Min.Nodes Min_Child Min_Keys
1 1 2 1
2 2 2*25 2*24
3 50 --- 50*24
So total keys = 1 + 2*24 + 50*24 = 1249.
Am i right?