-
The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1 kbyte, data record pointer is 7 byte long, the value field is 9 byte long and a block pointer is 6 byte long, what is the order of the leaf node?
-
- 63
- 64
- 67
- 68
- 63
Correct Option: A
Disk Block size = 1024 bytes
Data Record Pointer size, r = 7 bytes
Value size, V = 9 bytes
Disk Block ptr, P = 6 bytes
Let order of leaf be m. A leaf node in B+ tree contains at most m record pointers, at most m values, and one disk block pointer. r*m + V*m + p ⇐ 1024
16m ⇐ 1018
