A scheme for constructing ordered minimal perfect hashing functions (Q1820600)

This paper describes a method to be used for the organization and retrieval of data. Jaeschke proposed the function \(h(k)=\lfloor C/(Dk+E)\rfloor mod n\), where n is the size of a given key set, for constructing minimal perfect hashing functions. We propose another minimal perfect hashing scheme based upon number theory, with the function \(h(k)=\lfloor C/T(k)\rfloor mod n\). The keys can be stored in ascending order by applying this hashing function. A straightforward method to calculate the important parameter C is presented.