Within this type of database, data is hashed for storage location, to identify which database partition will store the data.
在这种类型的数据库中，数据被根据存储位置进行散列，以标识哪个数据库分区将存储数据。
At a later time, the data can be hashed again and compared to the protected value.
可以在以后再次散列该数据并与被保护的值进行比较。
Usually, data is hashed at a certain time and the hash value is protected in some way.
通常，在某个时刻散列数据并以某种方式保护哈希值。
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.
但是，在基于DHT的P 2 P网络中，内容相似的文档，其数据标识通过一致性哈希散列，均匀随机分布在节点空间中，不利于复杂查询的进行。
应用推荐