2003•Unpublished venueRequires access

A simple perfect hashing method for static sets

M. Ramakrishna

Abstract

Perfect hashing refers to hashing without collisions. There are a number of methods proposed in the literature for determining perfect hashing functions for a given key set. Direct perfect hashing methods are those which do not involve auxiliary table lookup. This paper proposes a direct perfect hashing method using random functions. This method is shown to be as good as any other in performance, and simple to use.>

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 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, Hash table, Simple (philosophy), Hash function, Perfect hash function, Consistent hashing, K-independent hashing, Computer science