Hash addressing of the quasi-permanent key arrays in multilevel memory

摘要

A hash search organization is proposed that uses quasi – permanent keys in conjunction with perfect hash addressing and probing. The particular characteristic of the proposed method is the fact that the model is oriented to a multilevel organization of the memory of modern computational systems. A mathematical model of the hash search in multilevel memory has been developed that allows the optimization of the hash memory parameters during the design.