A B+ tree index is to be built on the name attribute of

Home » Database » Database miscellaneous » Question

A B⁺ tree index is to be built on the name attribute of the relation STUDENT. Assume that all student names are of length 8 byte, disk blocks are of size 512 byte and index pointers are of size 4 byte. Given this scenario, what would be the best choice of the degree (i.e., the number of pointers per node) of the B⁺ tree?

1. 16
2. 42
3. 43
4. 44

Correct Option: C

Size of 1 record of index = 8 + 4 = 12 bytes.
Let no. of pointers required = P
No. of index values per block = P – 1
So (P – 1) 8 + 4P = 512
12P = 520 or 12. P < = 520
P < = 43