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秒。
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)。
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.
对于更深层次中找到的工作项，我们可以按照相同的方式，将新的联系表格和内部表格嵌入到已存在的内部表格之中。
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，并通过散列连接列的值生成一个查找表。
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表。
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，散列连接列的值，并检查为内表生成的查找表。
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.
通常情况下，在外部输入的基数显然不小且对于内部表没有一种有效的访问方法时，优化器会选择合并扫描联接。
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.
从性能的角度来看，这被认为是一个非常有效的联接操作，因为通过贯穿唯一索引的唯一访问扫描内部表的成本是最优的。
If the inner table does not have an index, the database server will compare the cost of building an index on the table to the cost of a sequential scan, and will choose the one with the least cost.
如果内部表没有索引，那么数据库服务器就会将在表上构建索引的成本与连续扫描的成本进行比较，然后选择成本最低的那一种方法。
For every row found in the outer table, the database server searches for its corresponding row in the second (or inner) table.
对于在外部表中找到的每一行，数据库服务器将在第二个(或内部)表中搜索其相应的行。
For every row found in the outer table, the database server searches for its corresponding row in the second (or inner) table.
对于在外部表中找到的每一行，数据库服务器将在第二个(或内部)表中搜索其相应的行。
应用推荐