Abstract

We present an algorithm for generating perfect tabulation hashing functions by reduction to Boolean satisfaction (SAT). Tabulation hashing is a high-performance family of hash functions for hash tables that involves computing the XOR of random lookup tables. Given $n$ keys of word size $W$ , we show how to compute a perfect hash function in $O(nW)$ worst-case time. This is competitive with other perfect hashing methods, and the resultant hash functions are simple and performant.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call