Comparing Hash Functions and Collision Resolutions

[dansongarcia]

I am currently doing an investigation in this topic. Please give some feedback that can help me in my investigation.

Is there any way to compare hash functions namely: Extraction, Folding, Division(mod)? If there is what kind of comparison can I do?

How about the collision resolution techniques: linear probing, quadratic probing and separate chaining?

This is only a simple research. Is there any other way that I can make it better? How?

Hope that anyone can help me thanks!

[JosAH]

Have a look at "The Art Of Computer Programming" volume 3 "Searching and Sorting"
by Donald Knuth. He explains and proves it all.

kind regards,

Jos