从InformixSYSCHUNKS系统表中读数据，并根据以下标准包括镜像块。
Read data from the Informix SYSCHUNKS system table and include mirror chunks according to this criteria.
对于mdc表，还有包含数据的块(block)数。
然后，将这两个块传递给下一个阶段的两个不同的XML输入stage，以提取“S_CONTACT”和“S_ORDER”表的数据。
You then pass the two chunks to two separate XML input stages of the next phase to extract data for the table "S_CONTACT" and "S_ORDER". The job diagram is shown in Figure 33.
缓冲池是内存中的一块存储区域，用于临时读入和更改数据库页(包含表行或索引项)。
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.
使用与关系数据库一起提供的块载入工具来初始化数据库表。
Use the bulk load tools that are provided with relational databases to initialize database tables.
数据库切分是一个固有的关系流程，可以通过一些逻辑数据块将一个表的行分为不同的小组。
Database partitioning is an inherently relational process of dividing a table's rows by some logical piece of data into smaller groups.
如果无法将排序的数据整个放入排序堆中(排序堆是每次执行排序时分配的一块内存)，它就会溢出到该数据库所有的临时表中。
If the sorted data cannot fit entirely into the sort heap, which is a block of memory that is allocated each time a sort is performed, it overflows into a temporary table owned by the database.
牢记数据库的构建块及其继承关系：数据库由表组成，表由字段组成。
Always keep in mind the building blocks of databases and their hierarchical relationships: databases consist of tables, which consist of fields.
紧凑的数据表可以针对基于行的数据库做存储块优化，让SQL执行得更好。
Compact tables can optimize storage blocks for row-based databases and accordingly make SQL perform better.
对于mdc表，数据根据维值被组织到块中。
With MDC tables, data is organized into blocks according to dimension values.
换句话说，表的一行是作为读写单独一块数据的最小单位。
Put another way, a row of a table is an atomic unit that is read and written as a single piece.
收集到的关于空余块的数据被存储在一个名为free_chunks的数据库表中，该表的格式如下。
The collected data about the free chunks is stored in a database table named free_chunks that has the following format.
RAWDEVSIZE程序分析可用原始设备，并将空闲块的偏移量、大小和路径信息存储到一个名为free_chunks的数据库表中。
The RAWDEVSIZE program analyzes available raw devices and stores the offset, size, and path information of free blocks into a database table named free_chunks.
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.
实现此奇妙功能的是一个称为过程链接表(Procedure LinkageTable) (plt)的数据块，它是程序中的一个表，列出了程序所调用的每一个函数。
The magic trick here that makes it work is a chunk of data called a Procedure Linkage table (PLT), a table in the program that lists every function that a program calls.
数据块的这部分包括了表和索引的数据。一条数据行是可以跨多个数据块的。
This portion of the data block contains table or index data. Rows can span blocks.
数据块的这部分包涵了关于数据块中拥有行的表的信息。
This portion of the data block contains information about the table having rows in this block.
相比一张表，只能存放在一块硬盘或者文件系统分区内。分区方式让存储更多数据成为了可能。
Partitioning makes it possible to store more data in one table than can be held on a single disk or file system partition.
这些数据块可能包含了包含了一张表，一个索引，甚至是一个控制文件。
These blocks may comprise a table , an index , or even the control file. While we.
如果一个数据块被分配给一个表或者簇表的数据段，或者被分配给一个索引的索引段，那么可用空间区还可能存储事务条目。
In data blocks allocated for the data segment of a table or cluster, or for the index segment of an index, free space can also hold transaction entries.
位图中的每一位代表一个或一组数据块。
Each bit in the bitmap corresponds to a block or a group of blocks.
数据块的这部分包涵了关于数据块中拥有行的表的信息。
This portion of the data block contains information about the actual rows in the block (including addresses for each row piece in the row data area).
数据块的这部分包涵了关于数据块中拥有行的表的信息。
This portion of the data block contains table or index data. Rows can span blocks.
苹果分区表包含了数块512字节的数据结构，每个分区使用一个数据结构。
The Apple partition map contains several 512-byte data structures, and each partition uses one data structure.
数据块的这部分包涵了关于数据块中拥有行的表的信息。
The header contains general block information, such as the block address and the type of segment (for example, data or index).
数据块的这部分包括了表和索引的数据。
The Oracle data block format is similar regardless of whether the data block contains table, index, or clustered data.
在不少关于索引的文档中，都提到常用的索引表会缓存，或者对于比较大的索引表，只缓存分支节点的数据块。
You want to guarantee all blocks of an index organized table are in buffer cache and are never flushed out?
在不少关于索引的文档中，都提到常用的索引表会缓存，或者对于比较大的索引表，只缓存分支节点的数据块。
You want to guarantee all blocks of an index organized table are in buffer cache and are never flushed out?
应用推荐