这将指示DB 2将索引键传递给内存中的排序程序，而不是再次将这些键写到DASD上的排序工作文件中，然后从中读取这些键。
This instructs DB2 to pass the index keys to the sort program in memory, rather than having the keys written to and read once again from sort work files on DASD.
集群成员还可以对工作进行排序，以确保按照在内存中的正确顺序对其进行处理，而不受任意其他集群成员的影响。
The cluster member can also order the work and ensure that it's processed in the correct sequence in memory, independently of any other cluster members.
下面的示例显示系统中每个活动进程的内存使用情况，并以恰当的方式排序。
The sample below shows you the memory usage for each active process running on your system, sorted in a nice format.
清单2中的命令向您显示了系统中每个活动进程的内存使用情况，并以一种恰当的方式进行了排序。
The command in Listing 2 shows you the memory usage for each active process running on your system, sorted in a nice format.
如果无法将排序的数据整个放入排序堆中(排序堆是每次执行排序时分配的一块内存)，它就会溢出到该数据库所有的临时表中。
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.
还请记住，AIX上大约有最大为250MB的私有虚拟内存用于LOAD中的索引键排序(这是内存瓶颈)。
Also keep in mind that on AIX, there is approximately a Max of 250mb of private virtual memory for index key sorting in LOAD (this is a memory bottleneck).
调试堆中产生的所有内存块在单个链接列表中连接起来，按照分配时间排序。
All the resulting memory blocks in the debug heap are connected in a single linked list, ordered according to when they were allocated.
调试堆中产生的所有内存块在单个链接列表中连接起来，按照分配时间排序。
All the resulting memory blocks in the debug heap are connected in a single linked list, ordered according to when they were allocated.
应用推荐