Improved exponential hashing

A new and efficient open addressing technique, called improved exponential hashing, is proposed. We show that improved exponential hashing has the ability to spread table elements more randomly than the widely used double hashing, and at the same time produces full length probe sequences on all table elements. We demonstrate experimentally that improved exponential hashing performs significantly better than double hashing for clustered data. Also, some theoretic analysis is provided along with the experimental results.