go top

b-tree node

网络释义

  数据页

4.3 InnoDB数据页(B-tree node)结构

基于30个网页-相关网页

有道翻译

b-tree node

b -树节点

以上为机器翻译结果,长、整句建议使用 人工翻译

双语例句

  • A FOT index is an index that is similar to a B-Tree index, but an FOT index has multiple root nodes and fewer levels. (B-Tree indexes have only one root node and more levels.)

    FOT索引类似B - Tree索引,多个节点较少(B - Tree索引只有一个节点更多的级)。

    youdao

  • B + tree consists of a root, internal nodes and leaves. The root may be either a leaf or a node with two or more children.

    内部节点组成。根可以具有两个更多个子节点的节点。

    youdao

  • B + tree can be viewed as a B-tree in which each node contains only keys (not key-value pairs), and to which an additional level is added at the bottom with linked leaves.

    可以视为B其中每个(内部)节点包含(不是值对),底部附加链式的叶子节点。

    youdao

更多双语例句
$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定