Specify the R-Tree access method.
指定r - Tree访问方法。
Example: Functional index using R-Tree access method.
示例：使用r - Tree访问方法的函数索引。
Some interesting facts about functional R-Tree indexes are.
下面列出了r - Tree函数索引的一些有趣特性。
The R-tree is a commonly used index structure of spatial data.
树是常用的空间数据索引结构。
We implement the R-tree indexing in SADBS which is a spatial analysis data...
在所研究的空间分析数据库系统SADBS中实现了R树索引。
Since the data is spatial, you need to specify the R-Tree access method for this index.
由于涉及到空间数据，您需要为这个索引指定r - Tree访问方法。
We implement the R-tree indexing in SADBS which is a spatial analysis database system...
在所研究的空间分析数据库系统SADBS中实现了R树索引。
Representation of direction relations and the retrieve of such relations based on R-tree;
基于区间值及其运算性质给出了不确定区域间方向关系的表示及推理方法。
In this example we show you how to create a functional index that USES the R-Tree access method.
在本例中，我们将向您展示如何创建使用r - Tree访问方法的函数索引。
That is to say, for very large spatial databases, QR-tree processes more superiority than R-tree.
也就是说，对于大型空间数据库索引来说，QR -树与R -树相比整体性能上具有较明显的优势。
Compared with grid and R-tree, the index has slightly space costs but most higher index performance.
与网格索引和R树索引相比，该索引以略大的空间开销换取了更高的查找性能。
We implement the R-tree indexing in SADBS which is a spatial analysis database system developed by us.
在所研究的空间分析数据库系统SADBS中实现了R树索引。
A functional index can specify different access methods that include B-Tree, R-Tree, and user-defined access methods.
函数索引可以指定各种不同的访问方法，包括B - Tree、r - Tree和用户定义的访问方法。
On the basis of this model , the author put forward a R-tree based Composite Spatiotemporal Index (CST-TREE) and described its structure and mechanism.
并在此模型上提出了一个基于R树的复合时空索引（CST-TREE）机制，定义了节点结构，并分析、描述了此索引的结构及原理。
A rectangular region of geography is roughly partitioned in several times to multilevel sub-regions, in which spatial index of R-tree has been constructed.
该方案首先将矩形地理空间进行租网格划分建立多级网格索引，然后针对每个小网格建立基于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.
结合网格索引和R树索引的特点，提出了一种基于网格与R树的多级混合索引。
R-tree is a dynamic index tree of space search. Its structure use multi-dimensional region to express spatial data object. R-tree is a valid way to visit rectangle.
树是空间搜索的动态索引树，它的结构是利用多个维中的区间来表示空间数据对象，它是矩形访问的一种有效方法。
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等访问方法和用户定义的访问方法，可以同时应用于函数索引和非函数索引。
QR-tree, a spatial index structure based on R-tree and a kind of space partition method using Quad-tree, is proposed. Its data structure and algorithms are also stated.
提出了一种基于R-树与“四叉树”空间层次划分的空间索引结构QR-树，给出了其数据结构和算法描述。
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-树的各自优点，既可以满足较高的存储效率，又避免太多的无效查找，达到较好的查找性能。
On the basis of fuzzy set theory, the peper considers thestorage reliability of military equipment by using fuzzy tree analysis with L - R fuzzy numbers.
在模糊集理论的基础上，应用L-R型模糊数的模糊故障树分析技术，探讨了装备贮存可靠性的研究问题。
In D1LP-R, a role encapsulates some rights, different roles can be organized as a role tree, and the rights of each role contain all of its sub-roles.
在D1LP R中，一个角色对应一些访问权限，不同的角色形成一个角色树，树中一个结点对应的权限包含它的所有子结点对应的权限。
In this paper, a robust and effective decision tree improved model R-C4.5 and its simplified version are introduced.
论文提出了一种健壮有效的决策树改进模型R - C4.5及其简化版本。
It is proved that the R-rotation graph of a elementary coronoid system is a multiple directed rooted tree containing at least 2 trees.
如果冠状系统是基本的，已经证明其R -旋转图至少包含2棵有向根树。
Secondly every Huffman tree must have following structure code, data, weight, parent, l-child and r-child but only code and data are needed in decoding .
而且每棵哈夫曼树都必须有以下结构：编码，信息，频度，双亲，左孩子，右孩子。
Secondly every Huffman tree must have following structure code, data, weight, parent, l-child and r-child but only code and data are needed in decoding .
而且每棵哈夫曼树都必须有以下结构：编码，信息，频度，双亲，左孩子，右孩子。
应用推荐