A B+-tree index is to be built on the Name attribute of the STUDENT relation.…
TPSC Computer/IT Posts · 2025 · Senior Informatics Officer · Section DGATE · 2002 · CS · Question 2 subparts
A B+-tree index is to be built on the Name attribute of the STUDENT relation. Each student name occupies 8 bytes, each disk block is 512 bytes, and each index pointer occupies 4 bytes. What is the best choice for the degree of the B+-tree, where degree means the maximum number of pointers in an internal node?
- A.
16
- B.
42
- C.
43
- D.
44
Attempted by 342 students.
Sign up free to check your answer
Sign up freeLoading lesson…