Re:Bloom Filters by Example
by user5994461 on Tuesday July 11, 2017 @07:02AM
(#14743100)
Bloom filters are data structure, in the same category as hashtable and trees.
They need a "hash" function to select an index for an item. A hash function in that context does not need to be cryptographic, it only needs to be quick and gives a good distribution of data.
SHA1 is slow, compared to a general purpose hash functions (typically murmurhash for bloom filters).
They need a "hash" function to select an index for an item. A hash function in that context does not need to be cryptographic, it only needs to be quick and gives a good distribution of data.
SHA1 is slow, compared to a general purpose hash functions (typically murmurhash for bloom filters).