MD c块索引意味着需要的RID索引更少。
MDC block indexes means that fewer RID indexes are required.
记录并删除mdc表的块索引中的块索引(BID)索引项。
Logs and removes the block index (BID) index entry from the MDC table's block indexes.
多维集群(V 8GA)：使用块索引，数千个记录共用一个索引条目，实现索引压缩。
Multidimensional Clustering (V8 GA) : Implements a form of index compression by using block indexes, one index entry for thousands of records.
DB 2V8.2.2中这种新的DELETE算法可以显著减少与mdc表中行及其相应的块索引的删除相关的日志记录和处理。
This new DELETE algorithm in DB2 V8.2.2 can drastically reduce the logging and processing associated with the deletion of rows in an MDC table and its corresponding block indexes.
它包含表、索引、表空间和缓冲池的控制块信息。
It contains control block information for tables, indexes, table Spaces, and buffer pools.
当扫描一个mdc表时，对于索引扫描，块锁可以推迟。
When scanning an MDC table, block locking could be deferred for an index scan.
这个小节探索了超块（superblock）、索引节点（或inode）、目录条目（或 dentry）和文件对象。
This section explores the superblock, the index node (or inode), the directory entry (or dentry), and finally, the file object.
最终，它通过将其块位置添加到PDOMFile来填充该文件的索引。
Finally, it populates the file's index by adding its block location to the PDOMFile.
关键字缓冲区保存了myisam表的索引块。
当把内存块返回给空闲池时，像分配时一样计算bucket索引。
When a block of memory is returned to the free pool, the bucket index is calculated just like it is done with allocation.
DougLea的分配程序有着与我们的版本非常类似的基本结构，但是它加入了索引，这使得搜索速度更快，并且可以将多个没有被使用的块组合为一个大的块。
Doug Lea's allocator has a basic structure much like our version, but it incorporates indexes to make searching faster and has the ability to combine multiple unused chunks into one large chunk.
mke2 fs是用于在任何设备上创建ext2文件系统的实用程序—它创建超级块、索引节点以及索引节点表等等。
Mke2fs is the utility used to create an ext2 filesystem — creating the super block, inodes, inode table, and etc — on any device.
当从空闲池分配块时，首先使用以下公式把请求的字节数转换为bucket数组索引。
A block is allocated from the free pool by first converting the requested bytes to an index in the bucket array, using the following equation.
远程表和索引的一些物理属性（例如块的数量、索引级别的数量）
Some physical attributes of remote tables and indexes (e.g. number of blocks, number of index levels)
这个参数决定了一个索引块中的最大的文档数。
This parameter determines the maximum number of documents per segment index.
数据根据节点分块，所以这些查询能分别在各自的数据块，通过一个索引过的范围查询得到结果。
Data is partitioned by node, so these queries can each be answered by a single partition, using an indexed range query.
缓冲池是内存中的一块存储区域，用于临时读入和更改数据库页(包含表行或索引项)。
A buffer pool is an area of storage in memory into which database pages (containing table rows or index entries) are temporarily read and changed.
它是处理磁盘上的文件系统的基础，因为它定义文件系统的管理参数(例如，块的总数、空闲块和根索引节点)。
It provides the basis for dealing with the on-disk file system, as it defines the file system's managing parameters (for example, total number of blocks, free blocks, root index node).
第一个被解析的块有这个第一节的空白字段；后续块可能有一个或多个字节列出尚未关闭的标记的索引。
The first block that is now parsed has an empty field for this first section; subsequent ones are likely to have one or more bytes listing tag indexes that have not yet been closed.
将辅助索引拆分成数块，以实现并行性(请参阅下面题为PIECESIZE的讨论)。
Break up the secondary indexes into pieces in order to achieve parallelism (see discussion below entitled PIECESIZE).
Ext2fs了实现快速符号链接：不需要为此目的而分配数据块，并且将目标名称直接存储在索引节点(inode)表中。
Ext2fs implements fast symbolic links: no data blocks need to be allocated for this purpose, and the target name is directly stored in the inode table.
这个参数决定了在Lucene的一个索引块中可以存放多少文档以及把磁盘上的索引块合并成一个大的索引块的频率。
This parameter determines how many documents you can store in the original segment index and how often you can merge together the segment indexes in the disk.
在索引存取方法中，指明一个记录或数据块处于使用之中而且不再接受另一个使用请求的一种方法。
In the Indexed Access method, a method of indicating that a record or block is in use and is not available for another request.
数据块的这部分包括了表和索引的数据。一条数据行是可以跨多个数据块的。
This portion of the data block contains table or index data. Rows can span blocks.
随着更多的项目添加到索引中，各块将分割以在合适的位置容纳新的项目。
As more entries are added to the index, blocks will be split to accomodate the new entries in their proper location.
每个索引条目允许的块空间的阈值百分比。
Threshold percentage of block space allowed per index entry.
当然，当新值填满这些块时仍会发生块分割，但这将在索引的各部分发生，而不是一个地方。
Of course, block splits will still occur on these blocks as new values fill up the existing block but it's happening all over the index not just in one place.
相似的项将在索引中同一组中，所以索引块将按需分割，且新的项将填入同一个块，直至该块已满并分割。
Similar entries will group together in the index, so the index blocks will split as necessary and new entries will end up all hitting the same block until it too fills up and splits.
这些数据块可能包含了包含了一张表，一个索引，甚至是一个控制文件。
These blocks may comprise a table , an index , or even the control file. While we.
当一块数据接收一个哈希数字，这个数字则比其他现有的哈希号码索引。
When a piece of data receives a hash number, that number is then compared with the index of other existing hash Numbers.
应用推荐