hash chain 中文意思是什麼
hash chain
解釋
散列鏈-
To retrieve an iterator for the set of hash keys, the implementation briefly synchronizes to make sure the head pointers for each chain are current
去迭代器中檢索一組hash鍵的時候,實現就簡單地使用同步來保證每個鏈的頭指針是當前值。 -
Function used by the key class does not spread values evenly over the hash range or has a large number of hash collisions, certain bucket chains may be much longer than others, and traversing a long hash chain and calling
函數不能將value均勻地分佈在整個hash表范圍內,或者存在大量的hash沖突,那麼某些bucket鏈就會比其他的鏈長很多,而遍歷一個長的hash鏈以及對該hash鏈上一定百分比的元素調用 -
3 a new group key management scheme based on a full and balanced tree scheme in conjunction with one - way hash chain is proposed. by comparison, we find that it has good performance of low re - key communication costs and scalable property
提出一種採用單向哈希鏈結合完全平衡樹的分層密鑰管理方法,比較表明它在密鑰更新時通信次數較少,是一種高效的密鑰管理方案。 -
This means that elements cannot be added to or removed from the middle or end of the hash chain - elements can only be added at the beginning, and removal involves cloning all or part of the chain and updating the list head pointer
這就意味著不能將元素添加到hash鏈的中間或末尾,或者從hash鏈的中間或末尾刪除元素而只能從hash鏈的開頭添加元素,並且刪除操作包括克隆整個鏈或鏈的一部分並更新列表的頭指針。 -
Figure 1 illustrates a hash chain before an element is removed
圖1為刪除一個元素之前的hash鏈: -
Searches the appropriate hash chain for the desired key
它首先會在適當的hash鏈中搜索需要的鍵值。 -
While that hash chain is being traversed. the fact that
Hash value是從對象中的值計算得來的一個數字。 -
Eventually, the initial part of the hash chain ending in the removed element will be garbage collected
最終,原始hash鏈中被刪除的元素將會被垃圾收集。 -
Operations are defined in the obvious way, traversing each hash chain and then moving on to the next chain until all the chains have been traversed
操作以一種明顯的方式定義,即遍歷每個鏈然後轉到下一個鏈直到所有的鏈都被遍歷。 -
So once you have a reference into a hash chain, while you may not know whether you have a reference to the head of the list, you do know that the rest of the list will not change its structure
所以說只要有對某個hash鏈的一個引用,即使可能不知道有沒有對列表頭節點的引用,您也可以知道列表的其餘部分的結構不會改變。 -
Making reference to the thought of hash chain, a modification over traditional ocsp, client partially cached - ocsp, is proposed which can efficiently reduce not only the computation at the client and server side but also the band load
該方案可以有效減少客戶端及服務器端的計算量以及減輕帶寬負荷。最後在論文中還引入了ca信任路徑構建的新思路。 -
Because a thread could see stale values for the link pointers in a hash chain, simply removing an element from the chain would not be sufficient to ensure that other threads will not continue to see the removed value when performing a lookup
因為一個線程可能看到hash鏈中鏈接指針的過時的值,簡單地從鏈中刪除一個元素不足以保證其他線程在進行查找的時候不繼續看到被刪除的值。
分享友人