3 ms·
Scalable Datasets with Bloom Filters and Ruby
- russell 18y agoIt's a nice algorithmic arrow to have in your quiver. It allows you to determine if a piece of data is missing before you do an expensive lookup.
- gsmaverick 18y agoVery nice tutorial! Nice and easy to read.
- river_styx 18y agoNice article, but Ruby wouldn't have been my language of choice for illustrating HPC concepts.
- demallien 18y agoWhy ever not? If you're writing an application in Ruby, you're going to need the fastest algorithms on the block to make up for the interpreter's less than optimal performance. I would think that Ruby (and other dynamic script languages) need this type of technique more than just about any other environment.
- tlrobinson 18y agoThe Bloom filter algorithm is written in C anyway... http://github.com/igrigorik/bloomfilter/tree/master/ext/sbloomfilter.c http://github.com/igrigorik/bloomfilter/tree/master/ext/sblo...
- petercooper 18y agoAnd (just over a year ago) - http://www.rubyinside.com/bloom-filters-a-powerful-tool-599.html http://www.rubyinside.com/bloom-filters-a-powerful-tool-599....
- tlrobinson 18y agoThe "Ruby" label for this article is rather misleading. It doesn't talk at all about implementation, rather just calling into a library, which is written primarily in C anyway.