Does sdbm really "re-hash (my) key into an internal key."?? The data I am hashing is about 300bytes and I did the hashing to reduce data while getting a (quite) unique key... My understanding was that sdbm would 1:1 use the supplied data as key, but if it really hashes it - I would revert to feeding it the original.. Are you sure?
How could it implement a hash table without hashing the keys? I'm no SDBM expert, but this leads me to believe my guess is correct:
http://www.partow.net/programming/hashfunctions/#SDBMHashFunction
I can't answer your more specific performance questions. I doubt anyone can, with the possible exception of the people who wrote SDBM. I suggest you setup some benchmarks and try it!
-sam
In reply to Re^3: Further optimize usage of SDBM_File
by samtregar
in thread Further optimize usage of SDBM_File
by isync
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |