phyks
/
bloomfilter.js
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Add README.

This commit is contained in:
Jason Davies 2011-09-04 10:37:42 +01:00
parent fd8e588ac8
commit ff2944c243
1 changed files with 11 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
README.md Normal file
View File

@ -0,0 +1,11 @@
Bloom Filter
============
This JavaScript bloom filter implementation uses the non-cryptographic
[Fowler–Noll–Vo hash function][1] for speed. In fact, the hash function only
needs to be called once per operation, as *n* hash functions can be simulated
using only two hash functions. And two 32-bit hash functions can be simulated
[using a single 64-bit hash function][2]!
[1]: http://isthe.com/chongo/tech/comp/fnv/
[2]: http://willwhim.wordpress.com/2011/09/03/producing-n-hash-functions-by-hashing-only-once/