go top

b-tree
[biː triː]

  • b 树

专业释义英英释义

  • B树

·2,447,543篇论文数据,部分数据来源于NoteExpress

B-tree

  • abstract: In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children.

以上来源于: WordNet

双语例句

  • Make sure you understand what types of queries they are useful for, and how their properties differ from those of B-trees.

    大家一定理解他们分别适合于哪种类型查询并且理解他们属性怎么有别于B树。

    youdao

  • Each table consists of one B-tree that contains the data, although there can be many secondary index B-trees used to provide different views of the data.

    尽管可能许多用于提供不同数据视图辅助性索引B,但每个一个包含数据的B树组成。

    youdao

  • Specifically, we changed the B-Trees storage mechanism so that the B-Trees would be rebuilt in the update areas, not necessarily rebuilding everything all of the time.

    具体地说我们修改B -存储机制,只更新区域重新构建B -树,而不必总是重新构建整个B -树。

    youdao

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

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

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