所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用CAS更新多个指针，同时不会让数据结构处于不一致的状态。
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.
列文和莱顿发明的是一种被称作“一致性哈希”的数学规划，这可以从根本上提高进程的速度。
What Lewin and Leighton invented was a mathematical scheme called "consistent hashing" that radically sped up the process.
在之前的文章中，我们讨论了ReplCache，它使用了基于哈希一致性的分布式技术实现了一个网格数据容器。
In a previous article, we discussed ReplCache, which is an implementation of a grid data container using consistent hash based distribution.
该模式增加了“分布式”特性，这是一种基于哈希一致性的技术。
一致性哈希算法目前在分布式存储中应用广泛。
The consistent hashing algorithm is used in distribute storage system at present.
但是，在基于DHT的P 2 P网络中，内容相似的文档，其数据标识通过一致性哈希散列，均匀随机分布在节点空间中，不利于复杂查询的进行。
But in DHT based P2P networks, similar documents are distributed randomly among peers with their data identifiers consistently hashed, which poses challenge on complex queries.
但是，在基于DHT的P 2 P网络中，内容相似的文档，其数据标识通过一致性哈希散列，均匀随机分布在节点空间中，不利于复杂查询的进行。
But in DHT based P2P networks, similar documents are distributed randomly among peers with their data identifiers consistently hashed, which poses challenge on complex queries.
应用推荐