如果用这些参数计算散列键，则很容易在缓存中找到同一视图的旧版本。
If the hash key is calculated from those parameters, previously generated versions of the same view can be retrieved easily from the cache.
由于处理器与请求者和参数无关，缓存散列键就可以仅由HTTP的action参数值组成。
Because the processor is independent of the requestor and the parameters, the hash key for caching simply can be composed of the value of the action HTTP parameter.
在清单5中，我们在调用期间动态地构建了数组引用，然后在打印结果时使用OID作为散列键。
In Listing 5 we build the array reference dynamically during the call, and then use the OID as the hash key when printing out the result.
当存储一个值时，客户机会从这个键确定出散列值以及它原来存储在哪个服务器上。
When you store a value, the client determines the hash value from the key and the server used to store it.
这样，我可以让它们作为散列的键、将要被检索的字符串列表，等等。
Thus, I can use them as hash keys, lists of strings to be searched, etc.
当获取一个值时，客户机会从这个键确定出相同的散列值并会选择相同的服务器来获取信息。
When you get a value, the client determines the same hash value from the key and chooses the same server to get the information.
散列码是一个整数，应该对每个键返回唯一的数字。
The hash code is an integer that should return a unique number of each unique key.
然后针对事实表扫描的每一行，外键也被散列并探测到位向量中，从而判断当前的事实表行是否被过滤掉了。
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.
散列算法应用于分区键的值，产生0 到 4095之间的一个分区号。
The hashing algorithm is applied to the value of the partitioning key, and generates a partition number between zero and 4095.
散列码应该在键空间上提供均匀的值分布，以便分区负载平衡。
The hash code should provide a uniform distribution of values over the key space so that the partitions are evenly balanced.
例如，如果键是整数，该值应该作为散列码。
For example, if the key is an integer, this value might serve as the hash code.
应用分区散列算法的代价与分区键的规模成比例。
The cost of applying the partitioning hash algorithm is proportional to the size of the partitioning key.
在使用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.
FETCH()函数从主散列或辅散列检索键，这里优先检索主散列。
The FETCH() function retrieves a key from either the primary or the secondary hash, where the primary hash is given preference.
分区的工作方式是对键计算散列码。
The way partitions really work is that a hash code is calculated on the key.
例如，如果您有3个分区，键的散列码为7,7除以3得2余1，所以项应该位于分区1。
For example, if you have three partitions, and your key's hash code is 7, then 7 divided by 3 is 2, remainder 1, so the item goes in and comes from partition 1.
当想要从一列memcached服务器存储或获取信息时，memcached客户机就会用一个一致的散列算法从这个键获取一个数值。
When you store or get information from a list of memcached servers, the memcached client derives a numerical value from the key using a consistent hashing algorithm.
稍后将在程序中搜索这些键，并且它们的最后记录时间将作为“event”散列元素的值存储。
These keys will be searched for later in the program and their last recorded time stored as the value of the "event" hash element.
如果控制键被找到，并且在%keys散列中指定了下一个按下的键，那么该键的事件时间将被记录下来。
If a control key is found, and the next key pressed is specified in the % keys hash, the event time for that key is recorded.
memcached客户机不必决定此信息，它只需对在存储信息时指定的键使用一个简单的散列算法。
Instead of having to determine this information, the memcached clients use a simple hashing algorithm on the key you specify when storing the information.
DATABASEPARTITIONING——按照键散列将数据分布在数据库的多个逻辑节点上(DPF)。
Database PARTITIONING - distributing data by key hash across logical nodes of the database (DPF).
使用环境参数作为到一个散列的键，从而派生出theme值。
Derive the Theme value by using the environment parameter as a key to a 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.
我使用一个散列映射作为类属性，但是必须构造一个包含国家、地区和页面起点的键，见LoadCities方法。
I used a hash map as a class attribute, but had to construct a key that included the country, the region, and the page start, as shown in the LoadCities method.
jCarousel的大多数默认选项是合适的，所以这个散列只包含一个键-值对：scroll，值为1，这让 jCarousel每次只显示一个图像。
Most of jCarousel's default options are fine, so your hash contains only one key-value pair: scroll, with a value of 1, which tells jCarousel to display only one image at a time.
通过对上述两个表的连接键(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.
如果- a是一个散列开关，那么hello仅会创建一个带有undef值的hello键。
If -a is a hash switch, then just hello will create a key of hello with an undef value.
要将项放入缓存，WebSphereeXtremeScale计算键的散列码，除以分区的编号，余数标识存储项的分区。
To place an item in the cache, WebSphere eXtreme Scale calculates the key's hash code, divides by the number of partitions, and the remainder identifies the partition to store the item.
遍历所有用户提供的命令行检索开关，比如- artist和-album(使用散列% freedb_searches的键，而不是手工列出开关)。
I step through all the user-provided command-line searching switches, such as -artist and -album (using the keys of the % freedb_searches hash instead of listing the switches manually).
LinkedIn在其Hadoop管道上构建了一个索引结构：这会产生几个TB的查找结构，该结构完美地使用了散列(每个键只需要2.5个位)。
LinkedIn builds an index structure in their Hadoop pipeline - this produces a multi-TB lookup structure that USES perfect hashing (requiring only 2.5 bits per key).
应用推荐