Hash partitioning is the method by which the placement of each row in the partitioned table is determined. The method works as follows.
散列分区是用于确定每一行在分区表中的位置的方法。
The use of the hash table with linked list provides the quickest lookup.
使用这种具有链表的散列表可以提供最快速的查询功能。
Instead, use an in memory hash table to cache the data and just keep a key to the data in the session.
相反地，应该使用内存中的哈希表来缓存数据，并且在会话中保存一个对此数据进行引用的键。
Symbols are effectively Pointers to strings stored in a hash table.
符号实际上是一种指针，指向储存在哈希表中的字符串。
It then appends all of that data as a hash table to the episodes array, which is a member variable.
然后将所有数据作为一个哈希表附加到剧集数组，该数组是一个成员变量。
If the URI does not exist in the internal hash table, a null is returned.
如果内部哈希表中没有URI，将返回空值。
In this method, one of the tables, usually the smaller one, is scanned and used to create a hash table in memory.
在该方法中，需要扫描其中的一个表，通常扫描较小的那个表，用它在内存中创建一个哈希表。
So to construct a nonblocking linked list, tree, or hash table, we need to find a way to update multiple Pointers with CAS without leaving the data structure in an inconsistent state.
所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用CAS更新多个指针，同时不会让数据结构处于不一致的状态。
The getCreateConnection() method uses a static hash table to determine if either an existing connection can be returned, or needs to be created.
getCreateConnection()方法使用静态哈希表来确定是否可以返回现有连接，或需要进行创建。
It selects a hash join with PART as the inner table which runs in 299 seconds.
它选择一个散列连接，以PART作为内部表，这个计划只需运行299秒。
The larger the probe table is in a hash join, the slower the join is.
散列连接中的探测表越大，连接就越慢。
You can use a table as an array, a dictionary (also called a hash or an associative array), a tree, a record, and so on.
我们可以将表作为数组、字典(也称为散列或联合数组)、树、记录，等等。
To do this, create a hash map as in Listing 3 that contains the row data you want to store in the table.
为此，创建一个如清单3中所示的散列映射，其中包含您想要存储在表中的行数据。
This dynamic filter on the fact table reduces the number of rows used in the probe phase of the actual hash joins.
事实表上的动态过滤减少了实际散列连接探测阶段使用的行数。
The scheme firstly builds a distributed hash table based on the physical topology of network, so that the topology mismatch problem of conventional DHT schemes can be eliminated.
首先直接基于网络的物理拓扑结构来构建一种分布式哈希表，从而有效地消除了现有DHT方案的拓扑结构不匹配问题。
For each row that satisfies the filter condition, the database server applies hash function to the key and proves the hash table to find a match.
在满足筛选器条件的每个行中，数据库服务器将对键应用哈希函数，并探测哈希表以查找匹配的键值。
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).
动态哈希连接包含两个动作：构建哈希（或者是我们所称的构建阶段），以及探测哈希表（或探测阶段）。
There are several ways to partition a table, but the focus of this article is distribution by hash.
对表进行分区的方法有几种，但本文只着重于哈希方式的分区。
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.
在扫描完第一个表并将它放在哈希表中之后，就扫描第二个表，并在哈希表中查找该表中的每一行，看是否可以进行连接。
In the build phase, the database server reads one table, and, after it applies any existing filters, it creates a hash table in memory.
在构建阶段，数据库服务器读取一个表，并且在应用所有现有筛选器之后，在内存中创建一个哈希表。
Note: IXF files cannot be used to load into a table defined in a hash partitioned database.
注意：无法使用IXF文件将导出表装入哈希分区数据库中定义的表。
This query plan uses hash join for each join between the fact table and a dimension table.
这个查询对每个事实表和维度表之间的连接使用散列连接。
Use each row from the top input to build a hash table, and each row from the bottom input to probe into the hash table, outputting all matching rows.
使用来自顶部输入的每一行创建哈希表，使用来自底部输入的每一行探测该哈希表。然后输出所有匹配行。
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，并通过散列连接列的值生成一个查找表。
You can think of a hash table conceptually as a series of buckets, each with an address that is derived form the key value by applying the hash function.
可以在概念上将哈希表认为是一系列的bucket，每个 bucket 所拥有的地址是通过应用哈希函数从键值导出的。
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表。
It performs a hash lookup through the interface Registry Table to try and locate the interface specification requested.
它在接口注册表中执行散列查询，寻找请求的接口规范。
Reduction in false lock contentions for row and table locks in the lock manager's hash table
减少锁管理器的hash表中对行和表锁的虚假锁竞争。
One of the recommendations shown for the LINEITEM table is to change the hash partitioning key.
关于lineitem表的一个建议是更改hash分区键。
One of the recommendations shown for the LINEITEM table is to change the hash partitioning key.
关于lineitem表的一个建议是更改hash分区键。
应用推荐