A B tree indexes a database file with search key 10 bytes, block 1024 bytes, record pointer 9 bytes and block pointer 8 bytes. If K is the order of the internal node and L the order of the leaf node, (K, L) =

1. A(57, 53)
2. B(50, 52)
3. C(60, 64)
4. D(34, 31)

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

Show answer & explanation

Correct answer: A. (57, 53)

Explanation

Internal (B+ style): 8K + 10(K − 1) ≤ 1024 gives K = 57. Leaf: 19L + 8 ≤ 1024 gives L = 53.

Note: The values match a B+ tree. For a plain B tree (record pointers in internal nodes) the internal order would be 38.