<p><b>Abstract</b>—The <it>amount of memory</it> required by <it>perfect hash functions</it> at retrieval time is one of the primary issues to be taken into account when looking for such functions. This correspondence gives empirical evidence about the effectiveness of a strategy suitable to significantly reduce the memory requirements of the <it>order preserving minimal perfect hash function</it> proposed by Czech et al. [<ref rid="bibk10053" type="bib">3</ref>].</p>