A B+-tree index is to be built on the Name attribute of the STUDENT relation.…

PYQ GATE 2002

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?

  1. A.

    16

  2. B.

    42

  3. C.

    43

  4. D.

    44

Attempted by 475 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…