1 votes 1 votes Consider a relation R (A B C) with attribute size of A as 8 bytes. Disk block size is 512 bytes and block pointer is 8 bytes. The best choice for degree (maximum value) for B+ tree, if B+ tree was used for creating indexing on R(A B C) is__________ Databases b-tree + – Suvam Chatterjee asked Sep 9, 2015 Suvam Chatterjee 384 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes 8(n-1)+8n<=512 solving these u get n=32 Pooja Palod answered Sep 9, 2015 Pooja Palod comment Share Follow See 1 comment See all 1 1 comment reply AnilGoudar commented Jun 20, 2017 reply Follow Share as they are asking for degree, which is nothing but minimum number of childrens possible, then ans is ceil(n/2) = 16. Please correct me if i am wrong. Difference between degree and order of tree. 0 votes 0 votes Please log in or register to add a comment.
