Hash-memory with a limited time of search by the key

Markovskiy A.P.,  Porhun E.V., Mnatsakanov A.V.

In article the new hash-searching organization such that keys may storing in one of dual hash-address has been proposed. It is allowed to limit the searching time by dual memory access. The procedure of recursion recording keys into the hash-memory has been developed. The analytical evaluation of collision probability has been obtained. The possibilities of proposed organization for hash-searching in static and dynamic arrays of data has been analyzed


Full text (pdf)