All numeric hash values are stored using the index extension in the DB2-internal B-Tree index.
所有数值型hash值都使用DB 2内部的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索引。
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索引只有一个根节点和更多的级)。
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算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。
The B-Tree Scanner threads remove deleted index entries and rebalance the index nodes.
B - TreeScanner线程会去掉删除的索引项并重新平衡索引节点。
A functional index can specify different access methods that include B-Tree, R-Tree, and user-defined access methods.
函数索引可以指定各种不同的访问方法，包括B - Tree、r - Tree和用户定义的访问方法。
The B-Tree Scanner automatically determines which index items are to be deleted.
B - TreeScanner自动判断哪些索引项应该删除。
Index options like UNIQUE and CLUSTER, and access methods like B-Tree, R-Tree and user-defined access methods can apply to both functional and non-functional indexes.
诸如unique和CLUSTER等索引选项，以及B - Tree、r - Tree等访问方法和用户定义的访问方法，可以同时应用于函数索引和非函数索引。
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树组成。
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树组成。
应用推荐