Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
|
Question 686
|
The order of a leaf node in a B + tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ________.
|
16
|
|
|
63
|
|
|
64
|
|
|
68
|
|
|
None of the above
|
Question 686 Explanation:
Excluded for evaluation. No record pointer is given.
Correct Answer: E
Question 686 Explanation:
Excluded for evaluation. No record pointer is given.
