1985•Journal of the Chinese Institute of EngineersRequires access

On the design of letter oriented minimal perfect hashing functions

Chin‐Chen Chang, Jiann‐Cherng Shieh

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Dynamic perfect hashing, K-independent hashing, Universal hashing, Hash function, Perfect hash function, Consistent hashing, Hash table, Set (abstract data type)