## Discussion Forum

Que. | 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 block are 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 |

Answer:43 |