Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
|
Question 275
|
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?
|
42
|
|
|
43
|
|
|
44
|
|
|
16
|
Question 275 Explanation:
For B+ Tree (By default internal node)
Let the degree be p.
Let the index pointer be b.
Let the key value be k.
Let the degree be p.
Let the index pointer be b.
Let the key value be k.
Correct Answer: B
Question 275 Explanation:
For B+ Tree (By default internal node)
Let the degree be p.
Let the index pointer be b.
Let the key value be k.
Let the degree be p.
Let the index pointer be b.
Let the key value be k.
Subscribe
Login
0 Comments