Hacker News new | past | comments | ask | show | jobs | submit login
Scalable Datasets with Bloom Filters and Ruby (igvita.com)
21 points by igrigorik on Dec 27, 2008 | hide | past | favorite | 7 comments



It'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.



The "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.


Nice article, but Ruby wouldn't have been my language of choice for illustrating HPC concepts.


Why 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.


The Bloom filter algorithm is written in C anyway... http://github.com/igrigorik/bloomfilter/tree/master/ext/sblo...


Very nice tutorial! Nice and easy to read.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: