Therefore, it is usually much faster than B-tree or any comparison-based indexing method in general cases.
也就是它通常比 B-tree 要快的多，或是比任何基于比较的索引方法在一般情况下都快的多。
All modern DBMSs use hash or B-tree indexes to accelerate access to data.
所有现代DBMS都使用散列或者B树索引加速数据存取。
This may destroy the dense clustering property of the B-tree index.
这可能会降低索引表使用的平衡树索引的数据密度，从而影响索引表的性能。
This algorithm firstly makes a partitioned index on the set of all the prefix addresses in the CIDR list. Being partitioned, the CIDR list is changed into a B-Tree index structure. Then the algorithm does fast lookup in the CIDR list according to the non-keywords of the IP addresses.
该算法首先对CIDR表的全部前缀地址集合进行分割索引，分割后，CIDR表被改变成一种B-Tree索引结构；然后按照IP地址的非关键字对CIDR表进行快速查找。
The node fission during the B-tree creating can reduce the running efficiency and the space utilisation.
树的生成过程中结点的分裂会降低生成过程的系统运行效率和存储利用率。
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开发的。
For storage, we choose native XML model based storage. Data model is Tree model, and basic storage structure is B-tree on top of Object Oriented Database System.
对于数据存储，采用基于模型的原生XML存储方法，数据模型为树模型，以B树作为存储结构，底层存储采用面向对象的存储管理系统。
A red-black tree (or symmetric binary B-tree) is a self-balancing binary tree invented by Rudolf Bayer.
红黑树（平衡二叉树）是自平衡二叉树，由RudolfBayer发明。
Supports B-tree and bitmap indexes.
支持B-树和位图索引。
All numeric hash values are stored using the index extension in the DB2-internal B-Tree index.
所有数值型hash值都使用DB2内部的B-树索引中的索引扩展来存储。
For the network architecture, the dissertation provides a conception of " heap network ", in which the super node is selected by Heap sort and administer upon nodes. Then, these super nodes form themselves into a larger B-tree network.
在网络结构设计中，又创新性的提出了堆网络概念，堆网络中以堆排序的方式产生最优的超结点来管理普通结点，超结点又组成更大的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算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。
A functional index can specify different access methods that include B-Tree, R-Tree, and user-defined access methods.
函数索引可以指定各种不同的访问方法，包括B-Tree、R-Tree和用户定义的访问方法。
This feature supports B-tree indexes and functional indexes.
该特性支持B-树索引和功能性索引。
A column or a record in ese cannot span pages in the data b-tree.
在数据b树中，ese中的列或记录无法跨越页。
The objects and records making up a HAMMER filesystem is organized into a single, unified B-Tree.
由对象和记录所组成的HAMMER文件系统被组织成一个单一统一的B型树。
That column needs to have a declared data type on which DB2 can create a native B-Tree index.
这个列上声明的数据类型必须保证DB2能在这个列上创建一个本地B-树索引。
This allows for ultra-efficient lookups by key and enhances the performance of operations within the B-tree.
这就能通过键进行高效查找，并且提高B-树中的操作的性能。
That is, the B-Tree insertion and deletion algorithm is not extended to the whole unified tree.
这就是说，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）可以被用于存储节点，它已经实现了部分必要功能（例如嵌入式完整性）。