A backtracking method for constructing perfect hash functions from a set of mapping functions
From MaRDI portal
Given a set of mapping functions \(h_ j(k)\) from key space to address space (AS) the problem of constructing a perfect hashing scheme is to find a hash indicator table (HIT): iff HIT \([h_ j(k)]=j\) then k is stored in AS \([h_ j(k)].\) A backtracking method superior to those proposed previously (single-pass and multipass methods) is presented, which can always find for given mapping functions a perfect hash function when such a function does exist.
Recommendations
Cites work
- Backtrack Programming
- Backtrack programming techniques
- Comments on perfect hashing functions
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 3466515 (Why is no real title available?)
- scientific article; zbMATH DE number 3471582 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Perfect hashing functions
- Reciprocal hashing
Cited in
(5)
This page was built for publication: A backtracking method for constructing perfect hash functions from a set of mapping functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059411)