热门

最新

红包

立Flag

投票

同城

我的

发布
uesowys
计算机科技研究员
4 年前
trueuesowys

If all of the pages from bottom to up are full, maybe it will insert a new index in the root node,and then create sub-nodes from top to bottom until the leaf node,and then allocate new page for inserting new index in the leaf node.

CSDN App 扫码分享
分享
评论
1
打赏
  • 复制链接
  • 举报
下一条:
It's a mechanism of elder algorithm. It seems to have some disadvantages of costing much more.
立即登录