Otherwise the new hash number is added to the index and the new data is stored.
否则，新的哈希数添加到索引和新的数据存储。
In rare cases, the hash algorithm may produce the same hash number for two different chunks of data.
在极少数情况下，哈希算法可能会产生了两种不同的数据块相同的哈希数。
When a piece of data receives a hash number, that number is then compared with the index of other existing hash Numbers.
当一块数据接收一个哈希数字，这个数字则比其他现有的哈希号码索引。
If that hash number is already in the index, the piece of data is considered a duplicate and does not need to be stored again.
如果哈希号码已经在索引中的数据块被认为是重复的，并不需要存储一次。
When a hash collision occurs, the system won't store the new data because it sees that its hash number already exists in the index... This is called a false positive, and can result in data loss.
当哈希冲突发生时，系统不会储存新数据，因为它看到它的散列人数已经存在于索引…这就是所谓的假阳性，并可能造成数据丢失。
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 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.
tusers表存储用户ID(唯一的名称)、密码、(MD 5散列值)、密码过期日期、帐户是否已被锁定以及失败登录次数。
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.
要将项放入缓存，WebSphereeXtremeScale计算键的散列码，除以分区的编号，余数标识存储项的分区。
The number of buckets is typically much smaller than the domain of input values for the hash function.
bucket的数量通常比hash函数的输入值的范围小得多。
And then hash character takes in any string or character, single character, gives me back a number. Notice what I do.
然后哈希接受任何字符串或字母，单个字符，返回给我一个数字，注意我要做什么。
The hash code is an integer that should return a unique number of each unique key.
散列码是一个整数，应该对每个键返回唯一的数字。
In theory the hash table is a rather simple construct, just collection of arrays or linked lists divided into a finite number of buckets.
理论上，哈希表是一个非常简单的构造，就是数组或链表的集合被划分到有限数量的存储体中。
Instead of using a simple hash, the programmer must learn to use a number of new data structures and access methods.
程序员必须学习使用一些新数据结构和访问方法，而不是使用简单的散列。
A number of conditions can cause leaks, including ever-expanding hash tables, large resource objects being held indefinitely, and global JNI references not being cleaned up.
导致泄漏的原因很多，包括越来越多的散列表、不确定保存的大型资源对象和未清理的全局JNI引用。
Hence the meeting of 24 energy ministers in Washington, D.C. last week to attempt to hash out ways to use cleaner energy more efficiently, regardless of who's number one.
因此，上周24国的能源部长在华盛顿一同讨论如何更有效地使用清洁能源，这与谁位列能源消费国榜单的第一没有多大关系。
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.
下推散列连接的主要目的是减少处理的事实表行数，这样可以探测每个散列表。
DB2 10 also includes a number of new database design capabilities, such as inline large objects (LOBs), hash access, and RELEASE (DEALLOCATE), that can improve performance and cut CPU usage.
DB 210还包括几个新的数据库设计功能，比如内联大对象(LOB)、散列表访问和RELEASE (DEALLOCATE)，这些功能能够提高性能并减少CPU占用。
Ideally, each database partition in a hash-partitioned table should hold the same number of records.
理想情况下，一个哈希分区表内的每个数据库分区都应具有相同数量的记录。
The good news is the elements in any one spot in a hash table are likely to be a small number, three, four, five.
好的一点是在哈希表中，任何一个存贮点上的元素数据是很小的，三个，四个，五个。
Salting is a technique in which a random number is generated in order to compute the hash for the password.
Salting这种技术可以用于生成随机数，并将该随机数用于计算密码的哈希。
If the data is stored sequentially, the time to find the item is proportional to the size of the list. For each element, a hash function calculates a number, which is used as an index into the table.
如果数据是序列存储的，从中查询一个项的时间取决于数据列的大小。
The way hashcash poses a challenge is by asking "minters" to produce strings (stamps) that when hashed with the Secure Hash Algorithm, SHA-1, have a number of leading zeros in their hash.
hashcash提出质询的方式是，当通过安全散列算法（SecureHash Algorithm）进行散列时，要求“minters”生成 一个字符串（戳记，stamps），在它们的散列中有很多前导零。
To speed up the comparison of two configurations, I compute the hash of each case as a long number.
为加快两个配置的比较，我计算每个作为一项长期的号码，哈希。
The capacity is the number of buckets in the hash table, and the initial capacity is simply the capacity at the time the hash table is created.
容量是哈希表中 哈希元的数目，初始容量即哈希表创建时的容量。
With a large number of hash keys for a given number of rows, the likelihood of a collision decreases.
为给定数量的行准备很大数量的哈希关键，这可能降低冲突的可能。
With a large number of hash keys for a given number of rows, the likelihood of a collision decreases.
为给定数量的行准备很大数量的哈希关键，这可能降低冲突的可能。
应用推荐