The fundamental format of the file system is based on a single B+ tree, which makes search operations efficient and very scalable.
该文件系统的基础格式建立在单一的B+树的基础之上，这使得搜索的效率和可伸缩性增强。
ReiserFS uses a specially optimized b* balanced tree (one per filesystem) to organize all filesystem data.
ReiserFS使用了特殊的优化b*平衡树（每个文件系统一个）来组织所有的文件系统数据。
This feature supports B-tree indexes and functional indexes.
该特性支持B -树索引和功能性索引。
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-树结构索引、结构索引、内容或关键字索引之类技术以及其他技术进行索引。
The B-tree would store the key value, followed by a list of pointers to each of the physical rows.
B-树将存储键值，以及一个指向每个物理行的指针列表。
The result is much flatter B+tree indexes.
结果是相对较为浅的索引。
The fruit of the tamarind tree is high in B vitamins and calcium.
罗望子树的果实维生素B和钙的含量很高。
The syntax for creating a package is DPKG -b directory packagename.deb where directory contains the filesystem tree with all the requisite files for your program.
创建软件包的语法为dpkg - bdirectorypackagename . deb，其中directory包含文件系统树，该文件系统树含有程序的全部必需文件。
Then for each hash value, a separate B+tree is created that contains only the remaining key parts following the hash columns.
然后，对于每个hash值，一个单独B+tree被创建，只包含 hash列后面的其余关键部分。
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索引只有一个根节点和更多的级)。
All numeric hash values are stored using the index extension in the DB2-internal B-Tree index.
所有数值型hash值都使用DB 2内部的B -树索引中的索引扩展来存储。
The B-Tree Scanner threads remove deleted index entries and rebalance the index nodes.
B - TreeScanner线程会去掉删除的索引项并重新平衡索引节点。
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算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。
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等访问方法和用户定义的访问方法，可以同时应用于函数索引和非函数索引。
A functional index can specify different access methods that include B-Tree, R-Tree, and user-defined access methods.
函数索引可以指定各种不同的访问方法，包括B - Tree、r - Tree和用户定义的访问方法。
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）可以被用于存储节点，它已经实现了部分必要功能（例如嵌入式完整性）。
The B-Tree Scanner improves transaction processing for logged databases when rows are deleted from a table with indexes.
从有索引的表中删除行时，B - TreeScanner有助于改进启用了日志的数据库的事务处理。
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 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 -树中。
Late 2008 brought in the B-Tree file system (Btrfs), and more recently, two other unique file systems were introduced: NiLFS (2) and exofs.
年底引入了B - TreeFileSystem (Btrf)，最近又引入了两种独特的文件系统：NiLFS(2)和exofs。
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 中的位置距离根越近，汇总级别也就越高。
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.
树由根，内部节点和叶组成。根可以是叶或具有两个或更多个子节点的节点。
The B-Tree Scanner automatically determines which index items are to be deleted.
B - TreeScanner自动判断哪些索引项应该删除。
Levels - Number of levels in the b-tree.
levels- 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树组成。
B. Wanna rest for a bit under the tree?
要不要在树下休息一会儿？
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树，其中每个(内部)节点仅包含键(不是键值对)，并在其底部附加一层链式的叶子节点。
B little boy loved to come and lay around it every day. He climbed to the tree top, ate the apples, took a nap under the shadow...
一位小男孩，每一天到树下来，他爬上去摘苹果吃，在树荫下睡觉。
The previous research on B&B algorithm focused on simplifying the search tree in order to reduce the search complexity, and several improvements have already existed.
对B&B算法的研究集中在化简搜索树从而降低搜索复杂度上，提出了几种改进的B&B算法。
应用推荐