A B+ tree index is to be built on the
Name attribute of the relation
STUDENT. Assume that all students
Names are of length 8 bytes, disk block
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 ?
Name attribute of the relation
STUDENT. Assume that all students
Names are of length 8 bytes, disk block
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 ?
B+ Tree indexing problem
0 commentaires:
Enregistrer un commentaire