Abstract In this paper, the progress made in the area of designing minimal perfect hashing functions is reviewed. This paper points out that all minimal perfect hashing functions have one common disadvantage: They are only suitable for small key sets. Moreover, a new hashing scheme is proposed. An algorithm can be used to produce hashing functions for arbitrary set of letter oriented keywords is presented. By applying our method, the finding of minimal perfect hashing functions is guaranteed.