怎样计算一个普通索引（B+TREE）每层的块数？

Yong Huang

原帖由 fromeast 于 2010-4-1 21:11 发表
Thanks!

BTW, from my tests, I found branch blocks were always far less than leaf blocks. I wonder whether it is true for all indexes, and whether it is a feature of B+Tree.

It's true for all B+Tree indexes when the total number of blocks is big. I think the bigger block size, the more so.

Yong Huang

fromeast

Thanks a lot!