B-tree
英 [biː triː]
美 [biː triː]
网络 B树; 平衡树; 二叉树; 索引; 索引就是多余的
复数：b-trees
双语例句
- That means, the range producer function is invoked to create the start/ stop keys for a range scan on the DB2-internal B-Tree, which equates to point ranges for the search argument.
这意味着，范围生成器函数被调用，以创建用于DB2内部B-树上的范围扫描的起始/终止键，这等同于用于搜索参数的点范围。 - We are currently investigating whether using a customized B-Tree algorithm can make it possible to search with the help of wild cards and to store index documents more compactly.
我们目前正在研究使用定制的B-Tree算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。 - That column needs to have a declared data type on which DB2 can create a native B-Tree index.
这个列上声明的数据类型必须保证DB2能在这个列上创建一个本地B-树索引。 - When creating a foreign key, Informix automatically creates a B-Tree index on the child table when creating a foreign key.
创建一个外键时，Informix自动地在子表上创建一个B-Tree索引。 - This feature supports B-tree indexes and functional indexes.
该特性支持B-树索引和功能性索引。 - The results of the reduce call are stored in a B-Tree; the closer to the root the data is in the B-Tree, the higher-level the summary.
reduce调用的结果存储在一个B-Tree中；数据在B-Tree中的位置距离根越近，汇总级别也就越高。 - Leaves-Number of leaves contained in the B-tree
leaves-B-树中包含的叶子的数量 - Today, the B-tree file system ( BTRFS) can be used at the storage nodes, which already implements some of the necessary features ( such as embedded integrity).
今天，B-tree文件系统（BTRFS）可以被用于存储节点，它已经实现了部分必要功能（例如嵌入式完整性）。 - B-tree file system: Wikipedia provides a good introduction to Btrfs and offers links to many other sources of code and technical information.
B树文件系统：Wikipedia提供对Btrfs的精彩介绍以及其他代码和技术信息来源的链接。 - 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索引只有一个根节点和更多的级）。 - Levels-Number of levels in the B-tree
levels-B-树中的级数 - One of the most important advances in2.6.29 is the addition of the Btrfs ( or B-tree FS), originally developed by Oracle.
中最为重要的一个改进是添加了Btrfs（或B-treeFS），它最初是由Oracle开发的。 - Supports B-tree and bitmap indexes.
支持B-树和位图索引。 - A red-black tree ( or symmetric binary B-tree) is a self-balancing binary tree invented by Rudolf Bayer.
红黑树（平衡二叉树）是自平衡二叉树，由RudolfBayer发明。 - The B-tree would store the key value, followed by a list of pointers to each of the physical rows.
B-树将存储键值，以及一个指向每个物理行的指针列表。 - All numeric hash values are stored using the index extension in the DB2-internal B-Tree index.
所有数值型hash值都使用DB2内部的B-树索引中的索引扩展来存储。 - The data is then indexed using techniques such as XML pattern expression indexing, B-tree structural indexing, structural indexing, content or keyword indexing, and others.
然后，数据被使用诸如XML模式表达式索引、B-树结构索引、结构索引、内容或关键字索引之类技术以及其他技术进行索引。 - All the information like the levels of B-tree index, number of pages consumed by the table, number of distinct values of a column are stored.
这种模式存储诸如B-树索引的级数、表所占用的页数、一个列中不同值的数量之类的信息。 - A functional index can specify different access methods that include B-Tree, R-Tree, and user-defined access methods.
函数索引可以指定各种不同的访问方法，包括B-Tree、R-Tree和用户定义的访问方法。 - This allows for ultra-efficient lookups by key and enhances the performance of operations within the B-tree.
这就能通过键进行高效查找，并且提高B-树中的操作的性能。 - The objects and records making up a HAMMER filesystem is organized into a single, unified B-Tree.
由对象和记录所组成的HAMMER文件系统被组织成一个单一统一的B型树。 - That is, the B-Tree insertion and deletion algorithm is not extended to the whole unified tree.
这就是说，B型树的插入和删除法则无法被扩展到整个统一树。 - Pairwise Covering Test Data Generation based on Solution Space B-Tree
基于二叉解空间树的两两组合测试数据生成 - Represents a heap or B-tree involved in a deadlock.
表示死锁所涉及的堆或b树。 - A column or a record in ese cannot span pages in the data b-tree.
在数据b树中，ese中的列或记录无法跨越页。 - The node fission during the B-tree creating can reduce the running efficiency and the space utilisation.
树的生成过程中结点的分裂会降低生成过程的系统运行效率和存储利用率。 - Moreover, the author studies the parameterized pattern match problem of the software duplication and gives a method to this problem using String B-tree.
此外，作者还对软件复用中的参数化样式匹配问题进行了研究，并给出了用StringB-tree来解决此问题的方法。 - The Property Analysis of B-tree and its Application in Data Retrieval
B-树的性能分析及其在数据搜索中的应用 - In this article B-tree was introduced, and its property analysis was discussed, and an example about the application of B-tree in data retrieval was presented.
这里介绍了多路查找树&B-树，给出其定义和性能分析，并且对它在数据搜索中的应用进行了举例分析。 - The improved B-tree topological structure is superior to adaptability and fault tolerant ability.
改进的B-树网络拓扑结构适应了动态的P2P网络，具有高自适应性和高容错性。