Tree index model is to create index in the memory, as the main entrance of the retrieval.
树索引亡储模式从要非树立外亡索引，做为检索的最从要的入口。
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索引。
This paper classify a series of methods on spatial database index, and introduce the QR-tree index structure with very large spatial database.
在综述现有空间数据库索引技术的基础上，提出了一种面向大型空间数据库的QR-树索引方法。
This thesis mainly focuses on the study of suffix tree index technical dealing with bio-sequences and multiple sequences alignment problem in bioinformatics.
本文主要对适用于生物序列数据上的后缀树索引技术和生物信息学中的多序列比对算法进行了分析和研究。
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索引只有一个根节点和更多的级)。
QR-Tree index combines the advantage of Quadtree and R-Tree, not only serves the need of high storing efficiency, but also avoid of many invalidation query, in order to achieve good query capability.
树索引结合四叉树和R-树的各自优点，既可以满足较高的存储效率，又避免太多的无效查找，达到较好的查找性能。
Here you must find the index of the column in the position as it appears in the tree.
此处，我们必须在所选列在树中出现的位置找到该列的索引。
In this example we show you how to create a functional index that USES the R-Tree access method.
在本例中，我们将向您展示如何创建使用r - Tree访问方法的函数索引。
Since the data is spatial, you need to specify the R-Tree access method for this index.
由于涉及到空间数据，您需要为这个索引指定r - 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算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。
A functional index can specify different access methods that include B-Tree, R-Tree, and user-defined access methods.
函数索引可以指定各种不同的访问方法，包括B -Tree、r - Tree和用户定义的访问方法。
Example: Functional index using R-Tree access method.
示例：使用r - Tree访问方法的函数索引。
To produce the mapping, right-click the repeating element in the output tree and select Add Index from the menu as shown in Figure 1.
为了实现映射，右键单击输出树中的重复元素并在菜单中选择addIndex，见图1。
The B-Tree Scanner automatically determines which index items are to be deleted.
B -TreeScanner自动判断哪些索引项应该删除。
Most importantly, the sched_entity contains the vruntime (64-bit field), which indicates the amount of time the task has run and serves as the index for the red-black tree.
最重要的是， sched_entity包含vruntime（64位字段），它表示任务运行的时间量，并作为红黑树的索引。
The B-Tree Scanner threads remove deleted index entries and rebalance the index nodes.
B - TreeScanner线程会去掉删除的索引项并重新平衡索引节点。
The performance comparison was to index all of the PHP test scripts (*.phpt files) under the PHP 5.3 source tree.
性能比较所执行的是对PHP 5.3源树下的所有 PHP测试脚本（*.phpt文件）进行索引。
The first potential future change would modify the unacknowledged packet list so that it is organized with an index as a red-black tree instead of the current linear list.
第一个可能的未来改变是对未应答的包列表进行修改，因此包列表的组织形式不再是当前的线性列表而是通过索引组织成红-黑树。
The most common in-memory database index strategy is called T-tree.
最常见的内存中数据库索引策略是T -树。
But given you need to use a binary tree, I would store (index, value) in the binary tree and key on index.
但你需要使用一个二进制树，我会把(指数，值)在二树和关键指标。
A primitive sequence that would always use an index to access the next element would incur the cost for walking the tree at every access.
一个原生的sequence使用索引访问下一个元素，这样可能导致每次访问的时候都需要遍历树。
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等访问方法和用户定义的访问方法，可以同时应用于函数索引和非函数索引。
Synthetic selection index is a good measure for union selection on growth traits, tree form traits and wood properties.
综合选择指数是开展生长、树形和材质多性状优良家系联合选择的理想方法。
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树组成。
It parses the original RFC file, and generates a section directory tree as well as a page index for content browsing.
它剖析原来的RFC文件，并生成一个节目录树，以及作为一个网页索引的内容浏览。
In the data broadcast, the visits probability of the data record is various, therefore the index tree may be built through visit probability.
在数据广播中，数据记录被访问的概率各不相同，因此可以通过访问概率建立索引树。
The structure of the index tree decides the average index number to be visited, but even regarding the same index structure, the average visit time is different if the broadcast sequence is different.
索引树的结构决定了平均访问索引节点的数目，但是即使对于相同的索引结构，如果采用不同的广播序列，则平均访问时间也不尽相同。
Based on the former fact, we introduce the arithmetic coding algorithm based on binary index tree.
基于上述事实，本文引入了基于二进索引树的算术编码算法。
And also proposes the management method by using the functional index tree and adopting the chunks.
提出了运用功能索引树进行集中管理，并采用通过伪指令进行模块调用的方式。
应用推荐