合并扫描联接也被称为排序合并联接。
另外，DB 2无法在排序合并合并连接中使用随机顺序的索引列。
Also, DB2 cannot use random order index columns as part of a sort merge join.
如果是unionexpression类，evaluate方法将对两个操作数求值，检查在这两种情况下节点集的结果，然后使用排序合并策略组成联合。
In the case of the UnionExpression class, the evaluate method evaluates the two operands, checks that the result is in both cases a node-set, and then forms the union using a sort-merge strategy.
在这个示例中，结果列表是每个片各自排序的列表的合并版本。
In this example, the resultant list is a merged version of the individually sorted lists from each slice.
半数的线程将会退出同时另一半的线程将会在相邻的分区之间进行合并排序。
Half the threads will exist while the other half will perform merge sorts across adjacent partitions.
消息集合也会重新排序到合并的片段中。
The message set is then reordered into the combined fragment.
对于重新排序的操作，您可以在合并的片段之间重新排序消息集合。
With the reorder operation, you can reorder message sets into, out of, and between combined fragments.
因此，当与嵌套循环联接比较时，合并扫描联接可能对于排序输入产生成本。
So when compared to a nested loop join, the merge scan join may incur the cost for sorting the inputs.
FETCH(3)的结果集是根据ID字段排序的，并且使用T1的索引I1的合并联接而得到最终的结果集。
The result set from FETCH (3) is ordered by the ID column and joined using a merge join with index I1 for T1 to get final result set.
每个片各自排序了的执行结果被合并，并且在内存内由虚拟数据库再次进行排序，之后才会呈现给此应用程序。
The respective sorted results from each slice are merged and sorted again in memory by the virtual database before being presented to the application.
需要遍历该列表，将每个单词拆分为经过排序的字母数组，然后再次合并数组。
You want to iterate through the list, breaking each word into a sorted array of letters, then joining the array again.
在工具重新排序消息集合到合并片段时，它会首先检查目标合并的片段是否是消息集合有效的容器。
When reordering a message set into a combined fragment, the tool first checks whether the target combined fragment is a valid container of the message set.
合并起来，而那些小列表，我又会把他们拆成更小的列表，再排序，这会给我，一个更高效的算法么？
Where those pieces, I would do the same thing with, I would divide them up into smaller chunks, and sort those. Is that going to give me a more efficient algorithm?
使用内部和外部排序的合并扫描联接 (MSJOIN)
例如，如何实现合并排序。
合并排序的最差性能和平均性能为o (nlog n)。
Merge sort has o (n log n) worst-case and average-case performance.
EmadOmara的并行合并排序算法假设了在排序操作的过程中(操作者)对计算机的所有CPU具有完全的访问权限。
Emad Omara's parallel merge sort algorithm assumes that you will have full access to the machine's CPUs for the duration of the sorting operation.
接下来的20分钟：编程的问题。例如，如何实现合并排序。
20 minutes: Coding question. For example, implement merge sort.
sort命令还可以合并已经排序的文件，并检查某个文件是否已经排序。
The sort command can also merge already sorted files and check whether a file is sorted or not.
JDK文档说明，该方法采用修正的合并排序法，保证N*log(N) 的效率。
The JDK documentation indicates that this method gives you a modified mergesort with guaranteed N*log(N) performance.
但是由于很难在原地进行合并，所以合并排序的内存需求比能够原地进行的排序算法(例如快速排序)更高。
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.
这份草案文本合并和重新排序了各国提出的数百项针对上一个版本的修订要求，它的篇幅曾膨胀至不可收拾的300页之巨。
The draft text consolidates and reorders hundreds of changes demanded by countries to the previous version, which saw it balloon to an unmanageable 300 pages.
合并排序本身并非并行算法，因为它可以顺序执行。当数据集太大，内存无法容纳，必须分片保存的时候，经常使用合并排序。
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.
不能对含有不同高度合并单元格的选择执行排序。
A sort cannot be performed on a selection that includes merged cells with different heights.
假定有{slice1,slice2,slice3}这样的一个排序，合并结果清单中的元素将以同样的顺序出现。
Assuming an ordering of {slice1, slice2, slice3}, the elements in the resultant list will appear in the same order.
Clevr允许上传那些重叠的照片，排序之后会自动把它们合并起来。
Clevr is a website that allows you to upload your overlapped photos, sort them in order and automatically stitch them together.
清单1.使用fork - join库进行合并排序。
快速排序，与合并排序，没有结合一步：两个子阵形成一个已经排好序的数组。
Quick sorts, unlike merge sorts, have no combining step: two subarrays form an already-sorted array.
这是一个将两个数组合并成一个数组，并进行从小到大排序，去除相同的数据的一个程序。
This is a merger of the two arrays into one array, and from small to large order of removal of the same data of a program.
表格中有合并后的单元格，无法排序。
应用推荐