On the design of special hash functions for multiple hash tables

One disadvantage of bitstate hashing, the traditional probabilistic state space analysis method, is the possible large amount of wasted memory for achieving a high probability of no address collision in hashing. We look at tradeoff between hashing speed and memory assigned for hashing. This paper presents a method using multiple hash tables and special hash functions and shows relevant results not just in increasing the probability of no address collision but in reducing the memory for hashing.