profile-img
Eduncle Asked an Mcq
February 22, 2020 10:48 am

Suppose one block holds 8192 bytes. Each key uses 32 bytes. In a B-tree of order M there are M – 1 keys. Since each branch is on another disk block. We assume a branch is of 4 bytes. The total memory requirement for a non-leaf node is 

Choose Your Answer:
  • 0 Attempts
  • 0 Likes
  • 1 Comments
  • 0 Shares
  • Eduncle Best Answer

    The size of non-leaf node in B-tree = m(Pb) + (m – 1)(key + Pr)
    Here Pb is Block pointer and Pr is record pointer.
    Given That 
    Pb = 4 and key siz...

    Show more
    Likes(0) Reply(0)