标准的散列连接计划是如何工作的？
星型连接计划利用下推散列连接技术。
散列连接中的探测表越大，连接就越慢。
The larger the probe table is in a hash join, the slower the join is.
使用排序堆的操作示例包括内存中表的散列连接和操作。
Examples of operations that use the sort heap include hash joins and operations where the table is in memory.
这个查询对每个事实表和维度表之间的连接使用散列连接。
This query plan uses hash join for each join between the fact table and a dimension table.
每个散列连接都是右深查询，构建的表是一个小的维度表。
It's a right-deep query plan such that for each hash join, the build table is a small dimension table.
事实表上的动态过滤减少了实际散列连接探测阶段使用的行数。
This dynamic filter on the fact table reduces the number of rows used in the probe phase of the actual hash joins.
根据估计，访问计划中的散列连接将返回1行，而实际上是4行。
The hash join in the access plan estimates that 1 row will be returned when in fact it is 4 rows.
它选择一个散列连接，以PART作为内部表，这个计划只需运行299秒。
It selects a hash join with PART as the inner table which runs in 299 seconds.
事实表和任何维度表之间的连接都是等值连接，这使得散列连接成为可能。
The join between the fact table and any dimension table is an equi-join, which makes a hash join possible.
下推散列连接的主要目的是减少处理的事实表行数，这样可以探测每个散列表。
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.
注意，执行计划表明，每个散列连接的左边分支将返回大约800,000行，这是一个相当大的数字。
Note that the execution plan indicates that the left leg of each hash join will return about 800,000 rows, a significant number.
该连接的执行过程包括扫描散列连接中的内表CUSTOMERS，并通过散列连接列的值生成一个查找表。
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.
然后，它使用SHIP操作符读外表BAD_CREDIT，散列连接列的值，并检查为内表生成的查找表。
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.
利用下推连接技术的星型连接计划使得散列连接更加有效的主要原因是，在初期减少了事实表(探测表)的行数。
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.
这是表CUSTOMERS与昵称BAD_CREDIT之间的一个散列连接(hash join)，前者在联邦服务器本地，后者引用一个远程oracle表。
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.
您将找到的大部分结果都是哈希索引站点——有意地连接散列值和其相应关键字的站点。
Most of the results you'll find are hash indexing sites — sites intentionally built to connect hash values and their corresponding keys.
散列方式允许客户机连接尝试永远被路由到相同的服务器。
Hashing allows client connect attempts to always be routed to the same server.
轮流调度方式会将连接尝试均匀地分布到各个通道上，而散列方法则使用客户机的IP地址来确定目标通道。
Round robin would distribute connection attempts evenly among the channels, while hashing would use the client's IP address to determine the destination channel.
通过对上述两个表的连接键(pdb_id)进行散列处理来分布两个表也能确保给定pdbml文档中所有原子行均能作为本身的PDBML文档存储在相同的数据库分区中。
Distributing both tables by hashing on their join key (pdb_id) also ensures that all atom rows for a given PDBML document are stored in the same database partition as the PDBML document itself.
如果是这样，则运行上面所述的racluster命令，并且将把IP地址和该地址的所有连接的关联字节计数记录到%hosts散列中。
If so, the racluster command described above is run, and the IP address and associated byte count for all connections to that address is recorded in the % hosts hash.
Time维度表中满足过滤条件的 time_id连接键被散列以创建一个位向量，用于过滤以上跳跃式扫描的Orders 表行。
The time_id join keys that meet the filter requirements on the Time dimension table are hashed to create a bit vector that filters rows of the Orders table from the skip scan above.
每个check属性组成了以下连接字符串的MD 5散列(一种通常用于生成加密散列的消息摘要算法)。
Each check attribute constitutes an MD5 hash (a message digest algorithm commonly used in generating cryptographic hashes) of the following concatenated string.
每个check属性组成了以下连接字符串的MD 5散列(一种通常用于生成加密散列的消息摘要算法)。
Each check attribute constitutes an MD5 hash (a message digest algorithm commonly used in generating cryptographic hashes) of the following concatenated string.
应用推荐