考虑B +树,其中搜索关键字长12个字节,块大小为1024个字节,记录指针为10个字节长,块指针为8个字节长。树的每个非叶节点中可以容纳的最大密钥数为
(A) 49
(B) 50
(C) 51
(D) 52答案: (B)
解释:
Let m be the order of B+ tree
m(8)+(m-1)12 <= 1024
[Note that record pointer is not needed in non-leaf nodes]
m <= 51
Since maximum order is 51, maximum number of keys is 50.
这个问题的测验