In a B-Tree, each node represents a disk block. 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

1. A32M − 32
2. B36M − 32
3. C36M − 36
4. D32M − 36

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: B. 36M − 32

Explanation

M − 1 keys of 32 bytes plus M branches of 4 bytes: 32(M − 1) + 4M = 36M − 32.