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.
这将指示DB 2将索引键传递给内存中的排序程序，而不是再次将这些键写到DASD上的排序工作文件中，然后从中读取这些键。
If the sort will fit in memory, it will be very fast; otherwise, it overflows to disk and will be much slower.
如果排序可在内存中进行，它将非常快；否则，它会溢出到磁盘，而且慢得多。
Examples of operations that use the sort heap include hash joins and operations where the table is in memory.
使用排序堆的操作示例包括内存中表的散列连接和操作。
Well, sort of. We've known for a long time that quality sleep helps with good memory formation—that's one of the reasons that pulling all-nighters in college is NOT a successful strategy.
我们或多或少都知道好的睡眠质量有助于好的记忆力的形成--这就是在大学里成为一个夜猫子不是明智之举。
But because the merging is difficult to do in place, generally, it has higher memory requirements than in-place sort algorithms, such as quick-sort.
但是由于很难在原地进行合并，所以合并排序的内存需求比能够原地进行的排序算法(例如快速排序)更高。
Merge-sort is not an inherently parallel algorithm, as it can be done sequentially, and is popular when the data set is too large to fit in memory and must be sorted in pieces.
合并排序本身并非并行算法，因为它可以顺序执行。当数据集太大，内存无法容纳，必须分片保存的时候，经常使用合并排序。
The in-memory sort operation can be made effective (from storage and computation standpoints) under the fact that each list li is ordered by itself.
如果每个列表Li由自已排序，那么内存内的排序操作(从存储和计算的角度)可以变得很有效。
So you have to sort of remember the structure of the folders you have stored in the memory card.
所以你最好记住存储卡里的文件夹结构。
So you have to sort of remember the structure of the folders you have stored in the memory card.
所以你最好记住存储卡里的文件夹结构。
应用推荐