We have Received Your Query
One of our mentor will revert to you within 48 hours. Meanwhile you can Enjoy the Free Study Material
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
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.
Pb = 4 and key siz...