This example USES two for loops. The outer for loop takes care of each row in The Times table, and the nested for loop takes care of the columns within each row.
本例使用两个for循环，外面的for循环关注乘法表中的每一行，嵌套的for循环关注每行内的列。
So when compared to a nested loop join, the merge scan join may incur the cost for sorting the inputs.
因此，当与嵌套循环联接比较时，合并扫描联接可能对于排序输入产生成本。
For more information about nested loop joins, refer to the appropriate information center link in the Resources section for your DB2 platform.
要了解嵌套循环联接的更多信息，请参考参考资料部分中针对您的DB 2平台的适当的信息中心链接。
However, the benefit of the merge scan join is that the inner table does not have to be scanned repeatedly as it does for nested loop joins.
然而，合并扫描联接的好处是不必反复地扫描内部表因为其为嵌套循环联接工作。
In my experience, it will usually be a particular inner or nested loop, or a call to some third party library methods, which is the main culprit for running the program slow.
以我的经验来看，导致程序运行速度慢得罪魁祸首可能就是某个内部或嵌套循环，也可能是对第三方库函数的调用。
Therefore, in Figure 7 the optimizer chooses to sort the composite for the nested loop join.
因此，在图7中优化器选择排序嵌套循环联接的复合物。
Here's what happens at execution time for the first leg of the nested loop join.
以下是在执行嵌套循环联接的第一步时将发生的操作。
As previously stated, ordered input is essential to a merge scan join, but it is not required for nested loop joins.
如前所述，按顺序的输入对于合并扫描联接是必不可少的，但其无需嵌套循环联接。
For instance, you can see that any time the if condition is true, the nested while loop will execute at least one time (because the list length will be greater than zero).
例如，您可以看到，每当if条件为真的时候，嵌入其中的while循环至少会执行一次(因为list的长度肯定大于0)。
This paper presents a framework for nested loop transformation, including dependence graph and offset-collection construction, analysis, transformation, and code generation.
本文研究了多媒体应用中常见嵌套循环的变换框架，包含了依赖关系的抽象和建立、分析和变换，以及最后变换代码的生成。
This paper presents a framework for nested loop transformation, including dependence graph and offset-collection construction, analysis, transformation, and code generation.
本文研究了多媒体应用中常见嵌套循环的变换框架，包含了依赖关系的抽象和建立、分析和变换，以及最后变换代码的生成。
应用推荐