A displacement addressing method for letter-oriented keys
Abstract In this paper, a new method for minimal perfect hashing is proposed. Our scheme can process a rather large set of keywords and does not care the problem of letter-selection on each keyword. Our scheme employs the displacement of letters on each keyword to set up a minimal perfect hashing function. According to our experiments, up to one thousand keywords could be handled easily. Moreover, our scheme could be employed to handle more large key set if we subdivide such a key set into several proper-size subsets and apply our hashing function to them, respectively.