该特性支持B -树索引和功能性索引。
This feature supports B-tree indexes and functional indexes.
设计出R树索引文件结构。
在所研究的空间分析数据库系统SADBS中实现了R树索引。
We implement the R-tree indexing in SADBS which is a spatial analysis database system developed by us.
在所研究的空间分析数据库系统SADBS中实现了R树索引。
We implement the R-tree indexing in SADBS which is a spatial analysis data...
在所研究的空间分析数据库系统SADBS中实现了R树索引。
We implement the R-tree indexing in SADBS which is a spatial analysis database system...
最后提出了一种基于四叉树索引的海量图片的存储与检索方法。
And then he proposes a set of solution for cutting map image and storage of mass raster image.
树索引亡储模式从要非树立外亡索引，做为检索的最从要的入口。
Tree index model is to create index in the memory, as the main entrance of the retrieval.
与网格索引和R树索引相比，该索引以略大的空间开销换取了更高的查找性能。
Compared with grid and R-tree, the index has slightly space costs but most higher index performance.
结合网格索引和R树索引的特点，提出了一种基于网格与R树的多级混合索引。
According to the characteristics of spatial index of grids and R-tree, a hybrid structure of spatial multilevel index is presented based on grid and R-tree.
所有数值型hash值都使用DB 2内部的B -树索引中的索引扩展来存储。
All numeric hash values are stored using the index extension in the DB2-internal B-Tree index.
在综述现有空间数据库索引技术的基础上，提出了一种面向大型空间数据库的QR-树索引方法。
This paper classify a series of methods on spatial database index, and introduce the QR-tree index structure with very large spatial database.
基于数据分区、八叉树索引、访问预测等相关技术，实现海量数据的快速访问、快速检索、空间算法等。
The fast accessing, indexing and spatial computation algorithm is based on data redistribution, oct-tree indexing an...
本文主要对适用于生物序列数据上的后缀树索引技术和生物信息学中的多序列比对算法进行了分析和研究。
This thesis mainly focuses on the study of suffix tree index technical dealing with bio-sequences and multiple sequences alignment problem in bioinformatics.
树索引结合四叉树和R-树的各自优点，既可以满足较高的存储效率，又避免太多的无效查找，达到较好的查找性能。
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.
而当用户进一步希望索引某些目录的子目录树而非其它时，文档列表就能变得精确而无遗漏。
While one might still want to index some directory sub-trees, but not others, the list of documents can be exhaustive and precise.
我们不是很乐意使用DPSI，但是我们必须跨多个分区探测多个索引树来寻找行。
We are not so pleased with the DPSI if we must probe multiple index trees to find rows across multiple partitions.
此处，我们必须在所选列在树中出现的位置找到该列的索引。
Here you must find the index of the column in the position as it appears in the tree.
第一个可能的未来改变是对未应答的包列表进行修改，因此包列表的组织形式不再是当前的线性列表而是通过索引组织成红-黑树。
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.
甚至可以在xml树的特定路径上定义索引来改善性能。
Indexes can even be defined on particular paths in the XML trees to improve performance.
最重要的是， sched_entity包含vruntime（64位字段），它表示任务运行的时间量，并作为红黑树的索引。
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.
一个原生的sequence使用索引访问下一个元素，这样可能导致每次访问的时候都需要遍历树。
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.
增强的JFS2在执行索引节点搜索时使用二叉树表示形式，与JFS使用的线性方法相比，这种方法要好得多。
Enhanced JFS2 USES a binary tree representation while performing inode searches, which is a much better method than the linear method used by JFS.
最常见的内存中数据库索引策略是T -树。
The most common in-memory database index strategy is called T-tree.
负责为数据创建索引的代码位于sample . zip的source树中。
The code responsible for indexing the data is located in the source tree in the sample.zip file.
根据内存数据的特点，介绍了其数据组织方式和索引结构T树。
According to the features of main memory data, the data organizing mode and index structure Ttree are introduced.
尽管可能有许多用于提供不同数据视图的辅助性索引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.
它剖析原来的RFC文件，并生成一个节目录树，以及作为一个网页索引的内容浏览。
It parses the original RFC file, and generates a section directory tree as well as a page index for content browsing.
在数据广播中，数据记录被访问的概率各不相同，因此可以通过访问概率建立索引树。
In the data broadcast, the visits probability of the data record is various, therefore the index tree may be built through visit probability.
基于上述事实，本文引入了基于二进索引树的算术编码算法。
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.
应用推荐