如果数据库分区和范围分区一同使用，那么表内的行首先会跨数据库分区做散列处理，然后再在每个数据库分区中执行范围分区。
If database partitioning and range partitioning are used together, the rows in a table are first hashed across the database partitions and then range-partitioned within each database partition.
这个示例将在不同表中存储布尔值、标量、数组和散列。
This example will store booleans, scalars, arrays, and hashes in separate tables.
为此，创建一个如清单3中所示的散列映射，其中包含您想要存储在表中的行数据。
To do this, create a hash map as in Listing 3 that contains the row data you want to store in the table.
它选择一个散列连接，以PART作为内部表，这个计划只需运行299秒。
It selects a hash join with PART as the inner table which runs in 299 seconds.
利用下推连接技术的星型连接计划使得散列连接更加有效的主要原因是，在初期减少了事实表(探测表)的行数。
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.
然后针对事实表扫描的每一行，外键也被散列并探测到位向量中，从而判断当前的事实表行是否被过滤掉了。
Then for each row from the fact table scan, the foreign key is also hashed and probed into the bit vector to determine whether the current fact table row is filtered out.
我们可以将表作为数组、字典(也称为散列或联合数组)、树、记录，等等。
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.
事实表和任何维度表之间的连接都是等值连接，这使得散列连接成为可能。
The join between the fact table and any dimension table is an equi-join, which makes a hash join possible.
这个查询对每个事实表和维度表之间的连接使用散列连接。
This query plan uses hash join for each join between the fact table and a dimension table.
通过组合使用不同的密钥长度和散列算法，IBMNAS提供表1所示的加密类型。
With combination of different key lengths and different hashing algorithms, IBM NAS provides encryption types as shown in Table 1.
解决这个问题的一个简单方法是创建一个通用散列表，该表提供存储和检索字符串的一种机制。
A simple way around this is to create a general purpose hashtable that provides a mechanism for storing and retrieving strings.
如这个查询计划所示，不止一个散列表的键可以被下推来过滤事实表的行。
As this query plan shows, keys from more than one hash table build can be pushed down to filter rows of the fact table.
该连接的执行过程包括扫描散列连接中的内表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.
在位向量下推中，对于每次下推，数据库服务器通过散列维度表中的键来创建发送至事实表的位向量。
In a bit-vector pushdown, for each push-down, the database server hashes the keys from the dimension table to create a bit vector, which is shipped to the fact table.
它在接口注册表中执行散列查询，寻找请求的接口规范。
It performs a hash lookup through the interface Registry Table to try and locate the interface specification requested.
事实表上的动态过滤减少了实际散列连接探测阶段使用的行数。
This dynamic filter on the fact table reduces the number of rows used in the probe phase of the actual hash joins.
下推散列连接的主要目的是减少处理的事实表行数，这样可以探测每个散列表。
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.
星型连接计划中，数据库服务器在维度表中构建散列表的同时从维度表中下推键来过滤事实表。
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.
在使用DPF时，根据表的分布键(这在创建表时定义)的散列值，把表的每一行放在特定的数据库分区中。
With DPF, each row of a given table is placed in a specific database partition based on the hashed value of the table's distribution key, which is defined when the table is created.
每个散列连接都是右深查询，构建的表是一个小的维度表。
It's a right-deep query plan such that for each hash join, the build table is a small dimension table.
散列连接中的探测表越大，连接就越慢。
The larger the probe table is in a hash join, the slower the join is.
如果数据库中所装载的表的分区键是1到500,000之间的整数，则分区键被散列到0到4 095之间的一个分区号。
If the partitioning key for a table to be loaded in the database is an integer that has possible values between 1 and 500,000, the partitioning key is hashed to a partition number between 0 and 4 095.
然后，它使用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.
tusers表存储用户ID(唯一的名称)、密码、(MD 5散列值)、密码过期日期、帐户是否已被锁定以及失败登录次数。
The USERS table stores the user ID (unique name), the password (MD5 hash), the password expiration date, whether the account is locked, and the number of failed login attempts.
对于这个批处理任务，我们希望从获取的各种web页面的零散内容中生成表式的以逗号分隔的值(CSV)数据。
For this batch task, we want to produce tabular comma-separated value (CSV) data from some bits and pieces we find on those various Web pages we fetched.
通过对上述两个表的连接键(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.
这是表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.
只要把Preferences对象当作一个大的键—值散列表(这个表把树形结构中的键组织起来)。
Just think of the Preferences object as one big key-value hashtable that structures the keys in a tree-like structure.
散列分区是用于确定每一行在分区表中的位置的方法。
Hash partitioning is the method by which the placement of each row in the partitioned table is determined. The method works as follows.
应用推荐