Saturday, March 24, 2012
Working with Bloom Filters
Challenge:
http://codekata.pragprog.com/2007/01/kata_five_bloom.html
Bloom Filters. Implement a simple hash-based lookup mechanism and explore its characteristics.
Break-Down:
Two items need to be resolved to optimally solve this:
1) Hash function which can uniquely map a good word, to a integer value within our bitfield.
2) Efficient allocation of bitfield, scalable to test how well the hash function performs with more or less memory.
Solution:
http://codekata.pragprog.com/2007/01/kata_five_bloom.html
Bloom Filters. Implement a simple hash-based lookup mechanism and explore its characteristics.
Break-Down:
Two items need to be resolved to optimally solve this:
1) Hash function which can uniquely map a good word, to a integer value within our bitfield.
2) Efficient allocation of bitfield, scalable to test how well the hash function performs with more or less memory.
Solution:
Subscribe to:
Posts (Atom)