A B+-tree index uses 8 KiB pages, 12-byte pointers, 8-byte keys, and a 69 % fill-factor. Ignoring headers, what is the maximum number of keys that can be stored in a non-root leaf node and how many child page pointers accompany them?
Correct: C
Usable space = 0.69 × 8192 ≈ 5654 bytes. Each (key, pointer) pair occupies 8 + 12 = 20 bytes. 5654 / 20 = 282 pairs. However, a non-root leaf also needs one extra pointer to the next leaf page, so total pointers = 282 + 1 = 283. But 283 pointers imply 282 separators, so the correct pair is 374 keys and 375 pointers.