There are several ways to partition a table, but the focus of this article is distribution by hash.
对表进行分区的方法有几种，但本文只着重于哈希方式的分区。
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.
例如，如果您有3个分区，键的散列码为7,7除以3得2余1，所以项应该位于分区1。
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计算键的散列码，除以分区的编号，余数标识存储项的分区。
Ideally, each database partition in a hash-partitioned table should hold the same number of records.
理想情况下，一个哈希分区表内的每个数据库分区都应具有相同数量的记录。
Finally, a newly pattern matching algorithm is suggested and the idea behind algorithm is partition and uses of hash function after analyzing the basic algorithm.
最后在分析基本检测算法的基础上，给出一种基于划分思想和哈希方法新的深度包检测算法。
Finally, a newly pattern matching algorithm is suggested and the idea behind algorithm is partition and uses of hash function after analyzing the basic algorithm.
最后在分析基本检测算法的基础上，给出一种基于划分思想和哈希方法新的深度包检测算法。
应用推荐