A Vowel-oriented Retrieval Scheme on Minimal Perfect Hashing Searching

Abstract

Another hashing function for letter-oriented keywords based vowel-letter addressing mode is proposed in this paper. Our proposal could process a large number of keywords up to thousands in efficiency. A set of particular keywords is mechanically transformed into a hashing table in terms of the sets of offset and constant number associated with the extracted letters within the keywords. Having setup the hashing table, the retrieval for a query keyword could be immediately executed through a modular operation using a key-pair comp rising of an extracted letter and a specific number featured from the keyword. The manipulated times in average to address an exact keyword is notably less than that of [8] over the result of experiments. Moreover, not only the total mount of keywords processed in our scheme is more large than some other literatures, but also the collisions occurring among the keywords mapping are reduced under our proposed algorithms.