Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
|
Question 552
|
A B+ tree index is to be built on the name attribute of the relation STUDENT. Assume that all students names are of length 8 bytes, disk block 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 ?
|
16
|
|
|
42
|
|
|
43
|
|
|
44
|
Question 552 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
Then,
8(P-1) + 4P ≤ 512
12P – 8 ≤ 512
12P ≤ 520
P ≤ 43.33
P = 43
Correct Answer: C
Question 552 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
Then,
8(P-1) + 4P ≤ 512
12P – 8 ≤ 512
12P ≤ 520
P ≤ 43.33
P = 43