Next, we have to create the inner table.
接下来，我们必须要创建内部表格。
Next, , we have to create the inner table.
接下来，我们必须要创建内部表格。 。
The index exploited for the inner table happens to be a clustered index.
利用内部表的索引恰好是一个聚集索引。
It selects a hash join with PART as the inner table which runs in 299 seconds.
它选择一个散列连接，以PART作为内部表，这个计划只需运行299秒。
Now the inner table shows only the links that have the work item in the outer table as a target.
现在内部表格只是显示了外层表格中的工作项作为目标。
The higher the cardinality, the more probes into the inner table, one per qualifying (outer) record.
基数越高，进入内部表、每一条合格的（外部）记录的探测就越多。
Under Sub-Category, click table, which refers to the outer table of users, not the inner table of work items.
在Sub - Category之下，点击Table，它会引用用户外层表格，而不是工作项的内层表格。
Select the inner table of work items by clicking the table TAB at the bottom left of the table (see Figure 8).
点击表格(见于图8)左下部的table项，来选择工作项的内层表格。
You can do this by passing a parameter (in this case, the owner's user ID) from the outer table row to the inner table.
您可以通过从外层表格向内层表格发送一个参数(在本例中，是所有者的用户ID)，来实现这项任务。
One record of the inner table will match each qualifying record from the outer table (inner Input Cardinality value is 1).
一条内部表的记录将与来自外部表的每条合格的记录相匹配(内部输入基数值是1)。
Select the inner table of links, and bind its TARGET_ITEMID column to the WI_ITEMID column of the outer table (Figure 15).
选择联系的内部表格，并将其TARGET _ itemid列于外层表格(图15)的wi_itemid列联系起来。
The work items may contain sub-work items; therefore the inner table should include an embedded inner table and link table.
工作项可能包含有子工作项；因此内部表格应该包含一个嵌入的内部表格和联系表格。
For work items found in the deeper levels, we can embed new link tables and inner tables into the existing inner table the same way.
对于更深层次中找到的工作项，我们可以按照相同的方式，将新的联系表格和内部表格嵌入到已存在的内部表格之中。
Then we can create an inner table out of the link table, using the global variable as the inner table's WORK_ITEMID parameter value.
然后我们可以使用全局变量作为内部表格的 WORK_ITEMID参数值，来在联系表格外面创建一个内部表格。
For this report to make sense, you must limit the inner table to show only the work items that are owned by the user in the outer table row.
为了实现这一份报表，您必须将inner表格限制为只显示outer表格行中用户所拥有的工作项。
The join is performed by scanning the inner table of the hash join, CUSTOMERS, and generating a lookup table by hashing the join column values.
该连接的执行过程包括扫描散列连接中的内表CUSTOMERS，并通过散列连接列的值生成一个查找表。
That is, the inner table of the join operation will be scanned eight times, once for each of the eight qualifying records from the outer input.
也就是说，联接操作的内部表将被扫描8次，来自外部输入的 8 个合格的记录每个都将被扫描一次。
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.
然而，合并扫描联接的好处是不必反复地扫描内部表因为其为嵌套循环联接工作。
Because the inner table is scanned with TBSCAN, which does not guarantee the expected order for MSJOIN, a SORT node is added to enforce the order.
因为通过TBSCAN扫描内部表，即不能对MSJOIN保证预期的顺序，所以添加sort节点来执行顺序。
The guideline also specifies that the table CUSTACC should be the inner table of the join and the XML index ACC_CURRENCY should be used to access the CUSTACC table.
准则还指定应当将表CUSTACC作为连接的内表，而xml索引acc_currency应当用于访问custacc表。
Therefore, when deciding which join method to choose, the optimizer balances the sort cost and the performance benefit for the inner table scan to drive the decision.
因此，在决定选择哪种联接方法时，优化器为内部表扫描平衡排序成本和性能优势以便促进决策。
IT then reads from the outer table BAD_CREDIT using the SHIP operator, hashing the join column values, and checking in the lookup table generated for the inner table.
然后，它使用SHIP操作符读外表BAD_CREDIT，散列连接列的值，并检查为内表生成的查找表。
In this way, the inner table is an element of the outer table's cell, and the onRender events of the table, detail row and cell are firing before the inner table does.
通过这种方式，内部表格就是外部表格单元的一个元素，以及表格的onRender事件，具体行和单元会在内部表格操作之前引发。
In general, a nested loop join with sort composite is favored by the optimizer if the inner index is well-clustered and the inner table is expected to be probed many times.
一般来说，如果内部索引是良好的集群且预测内部表被多次探测，则使用复合排序的嵌套循环联将受到优化器的青睐。
Typically, the optimizer chooses merge scan join when the cardinality of the outer input is not obviously small and there is no efficient access method for the inner table.
通常情况下，在外部输入的基数显然不小且对于内部表没有一种有效的访问方法时，优化器会选择合并扫描联接。
If there is an index on the join column, the costs will be significantly less; otherwise the database server must perform table scans for all tables, both outer and inner tables.
如果连接列上有一个索引，那么其成本会相当低；否则，数据库服务器就必须对所有表(外部和内部表)执行表扫描。
With this design, the inner table retrieves only one work item at a time, so that as the sub-work items count increases, it takes an increasingly longer time to build the report.
有了这个设计，内部表格一次只获取一个工作项，这样随着子工作项数量的增加，构建报表就需要花费更长的时间。
The number of rows retrieved from the outer table after the database server applies any table filters is small, and the inner table has an index that can be used to perform the join.
在数据库服务器使用所有表筛选器之后，从外部表检索出的行数将很少，而内部表具有一个可用于执行连接的索引。
From the performance perspective, this is considered a very efficient join operation, because the cost for scanning the inner table is optimal via unique access through a unique index.
从性能的角度来看，这被认为是一个非常有效的联接操作，因为通过贯穿唯一索引的唯一访问扫描内部表的成本是最优的。
From the performance perspective, this is considered a very efficient join operation, because the cost for scanning the inner table is optimal via unique access through a unique index.
从性能的角度来看，这被认为是一个非常有效的联接操作，因为通过贯穿唯一索引的唯一访问扫描内部表的成本是最优的。
应用推荐