A minimal hash function for C?

Question

I can't use boost:hash because I have to stick with C and can't use C++.

But, I need to hash a large number (10K to 100k) of tokens strings (5 to 40 bytes length) so that search within those are fastest.

MD5, SHA1 or any long hash function seems too heavy for a simple task, I am not doing cryptography. Plus there is the storage and computing cost.

Therefore my question:

1. What might be the simplest hash algorithm that will ensure collision prevention in most practical cases.

2. How many bit to use for the hash value? I am developing for 32 bit systems. Does hash algorithm in Perl/Python use 32 bit hashes too? Or do I have to jump to 64?

3. Regarding implementation of hash tables in common scripting languages: does the implementation check for collisions or can I avoid that part altogether?

Answer 1

A general hash function for hash table lookup. It specifies Do NOT use for cryptographic purposes, but since you specified that you have no intent for that then you should be ok.

It Included is A Survey of Hash Functions to try out

Answer 2

1/ Here is a nice overview of the most notable known hash functions.

2/ 32bits should work just fine.

3/ You always need to check for collisions, unless you want to write a funny hashtable :)

Answer 3

You can find a good (and fast) hash function, and an interesting read, at http://www.azillionmonkeys.com/qed/hash.html

The only time you should not check for collisions, is if you use a perfect hash -- a good old fashioned lookup table, like gperf.

Answer 4

Have you considered using GLib?
http://library.gnome.org/devel/glib/2.20/glib-Hash-Tables.html

Answer 5

Try Adler32 for long strings or Murmur2 for short strings.

Answer 6

If you're on a posix alike system and sticking to plain C, I would simply use what the system already has to offer. man 3 hcreate offers you all details or you can find an online version here http://linux.die.net/man/3/hcreate