简体繁体 English

计算B +树的最小和最大高度

[英]Calculating the min and max height of B+ tree

原文 2017-09-19 10:07:16 1 1 algorithm/ b-tree

I was reading about how to calculate the height of a B+ tree, I found the we can calculate it using: 我正在阅读有关如何计算B +树的高度的信息，我发现我们可以使用以下方法进行计算：

Where N is the number of keys, and m is the order size. 其中N是键的数量，m是订单大小。 However, I dont know what is meant by the number of keys? 但是，我不知道键数是什么意思？ Is it the total number of records? 是记录总数吗？ Also, how to calculate the order size if I only have the data blocks, number of records, size of each record and the index? 另外，如果我只有数据块，记录数，每条记录的大小和索引，那么如何计算订单大小？

1 个解决方案

Number of keys is, maximum values that a particular block accepts. 键数是特定块接受的最大值。 You know B+ tree will have key and pointers in a block(consider). 您知道B +树将在一个块中考虑键和指针（考虑）。 If the new value enters, and if the size exceeds, then the split occurs because of overflow. 如果输入新值，并且大小超过限制，则会由于溢出而发生拆分。