Issue No. 10 - October (1988 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2.7056
<p>The authors survey the classical hashing-function approach to information retrieval and show how general hashing techniques exchange speed for memory space and flexibility in data manipulation operations such as insert, delete, and overflow. They also discuss recent developments in perfect hashing and minimal perfect hashing, which provide speed and memory compactness when the keys are known in advance.</p>
"Hashing for Dynamic and Static Internal Tables," in Computer, vol. 21, no. , pp. 45-56, 1988.