Star join plan utilizes push-down hash join technology.
星型连接计划利用下推散列连接技术。
The larger the probe table is in a hash join, the slower the join is.
散列连接中的探测表越大，连接就越慢。
It selects a hash join with PART as the inner table which runs in 299 seconds.
它选择一个散列连接，以PART作为内部表，这个计划只需运行299秒。
This join method is replaced by dynamic hash join for IDS version 7 and above.
在IDS版本7以及更高版本中，该连接方法已被动态哈希连接所取代。
The optimizer will choose dynamic hash join if none of the joined columns has index.
如果连接列上不存在索引，那么优化器将选择动态哈希连接。
As mentioned above, dynamic hash join is a new join method for IDS version 7 and above.
正如上面所提到的，动态哈希连接是IDS版本7以及更高版本中的新连接方法。
This query plan uses hash join for each join between the fact table and a dimension table.
这个查询对每个事实表和维度表之间的连接使用散列连接。
The most commonly used join methods are nested-loop join, sort merge join and dynamic hash join.
最常用的连接方法就是嵌套循环连接、分类合并连接和动态哈希连接。
The hash join in the access plan estimates that 1 row will be returned when in fact it is 4 rows.
根据估计，访问计划中的散列连接将返回1行，而实际上是4行。
A hash join method is requested to perform the join between the 'SECURITY' and the 'ORDER' tables.
请求使用一个hash连接方法来执行“SECURITY”和“ORDER”表之间的连接。
A hash join is usually faster than a sort merge join since there is no sort operation involved.
哈希连接通常比分类合并连接快，因为它没有涉及到分类操作。
It's a right-deep query plan such that for each hash join, the build table is a small dimension table.
每个散列连接都是右深查询，构建的表是一个小的维度表。
The join between the fact table and any dimension table is an equi-join, which makes a hash join possible.
事实表和任何维度表之间的连接都是等值连接，这使得散列连接成为可能。
Note that the execution plan indicates that the left leg of each hash join will return about 800,000 rows, a significant number.
注意，执行计划表明，每个散列连接的左边分支将返回大约800,000行，这是一个相当大的数字。
The primary purpose of a push-down hash join is to reduce number of rows processed from the fact table, which probes each of the hash tables.
下推散列连接的主要目的是减少处理的事实表行数，这样可以探测每个散列表。
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 dynamic hash join consists of two activities: building the hash (or build phase as we call it), and probing the hash table (or probe phase).
动态哈希连接包含两个动作：构建哈希（或者是我们所称的构建阶段），以及探测哈希表（或探测阶段）。
This is a hash join between the CUSTOMERS table, local to the federated server, and the BAD_CREDIT nickname that references a remote Oracle table.
这是表CUSTOMERS与昵称BAD_CREDIT之间的一个散列连接(hash join)，前者在联邦服务器本地，后者引用一个远程oracle表。
A star join plan utilizing push-down hash join technology makes hash joins more effective primarily due to reduction of fact table (probe table) rows early on.
利用下推连接技术的星型连接计划使得散列连接更加有效的主要原因是，在初期减少了事实表(探测表)的行数。
Join plan directives that force optimizer to use the designated join method to join tables in the query, either nested loop join, sort merge join, or dynamic hash join.
连接计划指示，强制优化器使用指定的连接方法来连接查询中的表，要么是嵌套循环连接、分类合并连接，要么是动态哈希连接。
In the previous example, if customer.customer_num and orders.customer_num are not indexed, dynamic hash join would be chosen by the optimizer as the best execution plan.
在前一个实例中，如果customer . customer_num和orders . customer_num都没有被索引，那么优化器将选择动态哈希连接来作为最佳的执行计划。
After the first table has been scanned and placed in a hash table, the second table is scanned and each row in the table is looked up in the hash table to see if a join can be made.
在扫描完第一个表并将它放在哈希表中之后，就扫描第二个表，并在哈希表中查找该表中的每一行，看是否可以进行连接。
Join operators such as HASH, MERGE SCAN and (in some situations) NESTED LOOP can also benefit from asynchrony by simultaneously executing the inner and outer legs of the join operator.
MERGESCAN等连接操作符和(在某些情况下)NESTEDLOOP也可以通过同时执行连接操作符的内分支和外分支而从异步中获益。
How a standard hash-join plan works?
标准的散列连接计划是如何工作的？
If the query includes a join, the optimizer must determine the join plan (hash, sort merge, or nested loop), and the order in which tables are evaluated or joined.
如果该查询包含了连接，那么优化器就必须确定连接计划(hash、sortmerge或nestedloop)，以及评估或连接表的次序。
In a star join plan, the database server pushes down keys from a dimension table to filter the fact table at the same time as it builds the hash table on the dimension table.
星型连接计划中，数据库服务器在维度表中构建散列表的同时从维度表中下推键来过滤事实表。
When hash tables are built, join keys are pushed down and used to filter the rows of the fact table, and performance improves dramatically.
构建散列表时，连接键被下推用于过滤事实表的行，性能也显著提高。
When hash tables are built, join keys are pushed down and used to filter the rows of the fact table, and performance improves dramatically.
构建散列表时，连接键被下推用于过滤事实表的行，性能也显著提高。
应用推荐