A hash function is any algorithm that maps data of arbitrary length to data of a fixed length. The values returned by a hash function are called hash values, hash codes, hash sums, checksums or simply hashes. From Wikipedia: http://en.wikipedia.org/wiki/Hash_function

learn more… | top users | synonyms

1
vote
0answers
18 views

Is the Rabin fingerprinting scheme with a random polynomial a universal hash function family?

Say I have a greater-than-expected number of collisions in my hash table that has 2^w buckets (half of them empty). So I pick a fresh new random CRC polynomial that generates w-bit check values (i.e., ...
1
vote
0answers
67 views

Built-in Context-and-Input-to-Output-Hashing in Compilers

Why doesn't (open source) compilers contain builtin funtionality for (shared) caching and reuse-fetching (using SHA1-hash of compiler-version, build-flags, target-platform and inputs) of executable ...
0
votes
0answers
31 views

Fast comparison of recursive directory tree against a database?

I'm creating basic media player in the style of foobar2000. I want to load Id3 tags into a database because scanning whole directory tree every time is slow. The problem is, when user changes ...
0
votes
0answers
69 views

Does multiple Bloom filters make sense?

In order to decrease the number of false positives, I came up with a couple of possible solutions. Create two different types of Bloom filters; eg. filter1 using 3 different hash algorithms, filter2 ...