B-tree

Question

In a B-tree,the block size is 512 bytes,search key is 2 bytes ,block pointer size is 6 bytes and record pointer size is 8 bytes.every node contains n-1 record pointers,n-1 search keys,n block pointers.Find out maximum number of search key that can be accommodated in level-0 B-tree?

(a) 32
(b) 31
(c) 30
(d) none

Comments

let x be order of B-tree

6x + (x-1)(2+8) <= 512

16x <= 512

x=32.

since 0-level B tree only one node will be there having 32-1 = 31keys

---

Hi @joshi_nitish, why have you added this line ' since 0-level B tree only one node will be there having 32-1 '. I think there is a condition on minimum number of keys in root node not on maximum except for the total size.

Every node can have maximum of 31 keys??? Please explain. Minimum keys in root node can be any number of keys while for others minimum should be greater than (Max no. keys)/2 keys???

Answer 1

maximmum key=31