Linked hashing: An improvement of open addressing techniques for large secondary storage files

Abstract

An improvement of open addressing resolution schemes for hash-based files on secondary storage is defined in this paper. Linked hashing exploits the increase in compressibility of a hash file when buckets are larger, given a fixed file allocation. Both average access times and the number of records stored can significantly improve, for large files where the ratio between the key length and the record length is much less than 1.