Question

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?

Answer 1

Answer:

34 mts

Explanation:

Answer 2

Answer:

The answer is :

34 mts

Explanation:

Please mark me as brainlist........