The fundamental format of the file system is based on a single B+ tree, which makes search operations efficient and very scalable.
该文件系统的基础格式建立在单一的B+树的基础之上,这使得搜索的效率和可伸缩性增强。
The results of the reduce call are stored in a B-Tree; the closer to the root the data is in the B-Tree, the higher-level the summary.
reduce调用的结果存储在一个 B-Tree 中;数据在 B-Tree 中的位置距离根越近,汇总级别也就越高。
The B-Tree Scanner threads remove deleted index entries and rebalance the index nodes.
B - TreeScanner线程会去掉删除的索引项并重新平衡索引节点。
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索引只有一个根节点和更多的级)。
When creating a foreign key, Informix automatically creates a B-Tree index on the child table when creating a foreign key.
创建一个外键时,Informix自动地在子表上创建一个B-Tree索引。
B + tree consists of a root, internal nodes and leaves. The root may be either a leaf or a node with two or more children.
树由根,内部节点和叶组成。根可以是叶或具有两个或更多个子节点的节点。
B + tree can be viewed as a B-tree in which each node contains only keys (not key-value pairs), and to which an additional level is added at the bottom with linked leaves.
树可以被视为B树,其中每个(内部)节点仅包含键(不是键值对),并在其底部附加一层链式的叶子节点。
The key generator computes the hash code for the given string, and that hash code is stored in the DB2-internal B-Tree.
键生成器计算给定字符串的hash码,这个hash码被存储在DB 2内部的B -树中。
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等访问方法和用户定义的访问方法,可以同时应用于函数索引和非函数索引。
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算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。
All numeric hash values are stored using the index extension in the DB2-internal B-Tree index.
所有数值型hash值都使用DB 2内部的B -树索引中的索引扩展来存储。
B-Tree operations tend to be limited to a single cluster.
型树操作往往被限制在单一的集群中。
Each cluster maintains a B-Tree of the records contained in that cluster and a unified B-Tree is constructed by linking clusters together.
每个集群维护着一个包含在此丛集中的记录的B型树。而各种相连的集群一起组成了一个统一的B型树。
Each cluster maintains a B-Tree of the records contained in that cluster and a unified B-Tree is constructed by linking clusters together.
每个集群维护着一个包含在此丛集中的记录的B型树。而各种相连的集群一起组成了一个统一的B型树。
The B-tree is a generalization of a binary search tree in that a node can have more than two children.
树是二叉搜索树的泛化,其节点可以具有多于两个的子节点。
Levels - Number of levels in the b-tree.
levels-B -树中的级数。
This feature supports B-tree indexes and functional indexes.
该特性支持B -树索引和功能性索引。
The B-tree would store the key value, followed by a list of pointers to each of the physical rows.
B-树将存储键值,以及一个指向每个物理行的指针列表。
B-tree file system: Wikipedia provides a good introduction to Btrfs and offers links to many other sources of code and technical information.
b树文件系统:Wikipedia提供对Btrfs的精彩介绍以及其他代码和技术信息来源的链接。
The data is then indexed using techniques such as XML pattern expression indexing, B-tree structural indexing, structural indexing, content or keyword indexing, and others.
然后,数据被使用诸如XML模式表达式索引、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树组成。
The B-Tree Scanner automatically determines which index items are to be deleted.
B -TreeScanner自动判断哪些索引项应该删除。
The B-Tree Scanner improves transaction processing for logged databases when rows are deleted from a table with indexes.
从有索引的表中删除行时,B -TreeScanner有助于改进启用了日志的数据库的事务处理。
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)可以被用于存储节点,它已经实现了部分必要功能(例如嵌入式完整性)。
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)可以被用于存储节点,它已经实现了部分必要功能(例如嵌入式完整性)。
应用推荐