- 07/12/2019 at 10:28 pm #1428095EduGorillaKeymasterSelect Question Language :
A B+ tree index is to be built on the name attribute of the relation ‘student’. Assume that all the students names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 14 bytes. Given this scenario that would be the best choice of the degree (no. Of pointers per node) of the b+ tree?
Options :-Post your Training /Course EnquiryAre You looking institutes / coaching center for
- IIT-JEE, NEET, CAT
- Bank PO, SSC, Railways
- Study Abroad