Database-Management-System

Question 50

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 bytes, disk blocks are of size 512 bytes, and index pointers are of size 4 bytes. Given this scenario, what would be the best choice of the degree (i.e. the number of pointers per node) of the B⁺-tree?

A	16
B	42
C	43
D	44

Database-Management-SystemB+-TreesGATE 2002

Question 50 Explanation:

Let P be the degree of the nodes.
Then,
8(P-1) + 4P ≤ 512
12P – 8 ≤ 512
12P ≤ 520
P ≤ 43.33
P = 43

Correct Answer: C

Question 50 Explanation:

Let P be the degree of the nodes.
Then,
8(P-1) + 4P ≤ 512
12P – 8 ≤ 512
12P ≤ 520
P ≤ 43.33
P = 43