Address hashing techniques

Sunilsbjoshi · 12-02-2007, 05:04 AM

Hi,

I am in search of few good hashing functions. The input key will be the address of the variable, based on that the hashing needs to be performed. My hash tabel size will be static say 64.

One technique I know currently is :http://www.concentric.net/~Ttwang/tech/addrhash.htm

Can you share any more better or available techniques.

Thanks

theNbomr · 12-02-2007, 11:58 AM

Since addresses of distinct variables are already unique, what do you gain by accessing the variables via a hash lookup? Am I missing something here, or is this a purely academic exercise (homework)?
--- rod.

95se · 12-02-2007, 01:55 PM

Quote:

Originally Posted by theNbomr

Since addresses of distinct variables are already unique, what do you gain by accessing the variables via a hash lookup? Am I missing something here, or is this a purely academic exercise (homework)?
--- rod.

A 32 bit address can index up 4 billion unique elements. He is probably only hashing a few hundred to a few thousand entries, so he wants a function that will give a good hash of a 32 bit integer.

If you search google, you'll get a bunch. Just choose one that looks good to you. You can try a few and see which one gives you less collisions. Addresses won't be random, they'll probably bunch up together, so you may have to be careful.