<?xml version="1.0" encoding="utf-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	>
<channel>
	<title>Comments on: Scalable Datasets: Bloom Filters in Ruby</title>
	<atom:link href="http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/</link>
	<description>A goal is a dream with a deadline.</description>
	<pubDate>Sat, 13 Mar 2010 15:30:23 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.7.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Gurikninymn</title>
		<link>http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/comment-page-1/#comment-232715</link>
		<dc:creator>Gurikninymn</dc:creator>
		<pubDate>Mon, 08 Mar 2010 00:21:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.igvita.com/?p=202#comment-232715</guid>
		<description>&lt;a href="http://getanabolics.com" rel="nofollow"&gt;http://www.mtv.com/onair/truelife/assets/flipbook_season8/steroids/tl_steroids_01.jpg&lt;/a&gt;

Searching for data on steroids and anabolic pills?  Learn to bodybuild without causing damage. There are many &lt;a href="http://hubpages.com/hub/bestbodybuildingsupplements101" rel="nofollow"&gt;body building&lt;/a&gt; articles to read.  It's hard finding good data.

&lt;a href="http://www.gather.com/viewArticle.action?articleId=281474978049542" rel="nofollow"&gt;Purchasing steroids&lt;/a&gt; on the open black market can be dangerous.  We strongly advise all people who use &lt;a href="http://theblogs.net/bestbodybuildingsupplement" rel="nofollow"&gt;anabolics &amp; steroids&lt;/a&gt; if your into &lt;a href="http://bodybuildingsup.livejournal.com/359.html" rel="nofollow"&gt;weight lifting&lt;/a&gt; then your going to want to check out.  &lt;a href="http://bodybuildingsupplement10.blogspot.com/2010/02/weight-training-getanabolicscom-body.html" rel="nofollow"&gt;Metabolism Steroids&lt;/a&gt; can reduce growth.  &lt;a href="http://www.getanabolics.com/" rel="nofollow"&gt;Body building suppliments&lt;/a&gt; are a key ingredient to improving your body building.  

There are many portals that talk about steroids and muscle growth.  Check out &lt;a href="http://getanabolics.com/" rel="nofollow"&gt;Body Building Suppliments&lt;/a&gt; for more info.</description>
		<content:encoded><![CDATA[<p><a href="http://getanabolics.com" rel="nofollow">http://www.mtv.com/onair/truelife/assets/flipbook_season8/steroids/tl_steroids_01.jpg</a></p>
<p>Searching for data on steroids and anabolic pills?  Learn to bodybuild without causing damage. There are many <a href="http://hubpages.com/hub/bestbodybuildingsupplements101" rel="nofollow">body building</a> articles to read.  It&#8217;s hard finding good data.</p>
<p><a href="http://www.gather.com/viewArticle.action?articleId=281474978049542" rel="nofollow">Purchasing steroids</a> on the open black market can be dangerous.  We strongly advise all people who use <a href="http://theblogs.net/bestbodybuildingsupplement" rel="nofollow">anabolics &amp; steroids</a> if your into <a href="http://bodybuildingsup.livejournal.com/359.html" rel="nofollow">weight lifting</a> then your going to want to check out.  <a href="http://bodybuildingsupplement10.blogspot.com/2010/02/weight-training-getanabolicscom-body.html" rel="nofollow">Metabolism Steroids</a> can reduce growth.  <a href="http://www.getanabolics.com/" rel="nofollow">Body building suppliments</a> are a key ingredient to improving your body building.  </p>
<p>There are many portals that talk about steroids and muscle growth.  Check out <a href="http://getanabolics.com/" rel="nofollow">Body Building Suppliments</a> for more info.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Flow Analysis &#38; Time-based Bloom Filters - igvita.com</title>
		<link>http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/comment-page-1/#comment-228134</link>
		<dc:creator>Flow Analysis &#38; Time-based Bloom Filters - igvita.com</dc:creator>
		<pubDate>Wed, 06 Jan 2010 17:45:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.igvita.com/?p=202#comment-228134</guid>
		<description>[...] Bloom Filter is a probabilistic data structure which can tell if an element is a member of a set. However, the reason it is interesting is because [...]</description>
		<content:encoded><![CDATA[<p>[...] Bloom Filter is a probabilistic data structure which can tell if an element is a member of a set. However, the reason it is interesting is because [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ilya Grigorik</title>
		<link>http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/comment-page-1/#comment-156348</link>
		<dc:creator>Ilya Grigorik</dc:creator>
		<pubDate>Wed, 31 Dec 2008 14:41:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.igvita.com/?p=202#comment-156348</guid>
		<description>Thomas, good tip. I'll merge an 'auto' method into the library, but I would still advise of being very careful with it. Size of the filter is only one of the variables, the type of data and the hashing function has a big impact as well.

Peter, I hear ya. It's one of those tools that is either invaluable when you need it, or not useful at all. Having said that, right now I have a perfect use case for it: filtering through a lot of data to find a few gems I'm looking for. 

Based on some research while I was writing the blog post, it's actually a fairly popular technique for a lot of high performance cache implementations (bloom filter as first line of defense).</description>
		<content:encoded><![CDATA[<p>Thomas, good tip. I&#8217;ll merge an &#8216;auto&#8217; method into the library, but I would still advise of being very careful with it. Size of the filter is only one of the variables, the type of data and the hashing function has a big impact as well.</p>
<p>Peter, I hear ya. It&#8217;s one of those tools that is either invaluable when you need it, or not useful at all. Having said that, right now I have a perfect use case for it: filtering through a lot of data to find a few gems I&#8217;m looking for. </p>
<p>Based on some research while I was writing the blog post, it&#8217;s actually a fairly popular technique for a lot of high performance cache implementations (bloom filter as first line of defense).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bloom Filter &#171; Prometheus Fusion Perfection</title>
		<link>http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/comment-page-1/#comment-156292</link>
		<dc:creator>Bloom Filter &#171; Prometheus Fusion Perfection</dc:creator>
		<pubDate>Tue, 30 Dec 2008 16:38:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.igvita.com/?p=202#comment-156292</guid>
		<description>[...] Bloom Filter in Ruby [...]</description>
		<content:encoded><![CDATA[<p>[...] Bloom Filter in Ruby [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: MFR</title>
		<link>http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/comment-page-1/#comment-156206</link>
		<dc:creator>MFR</dc:creator>
		<pubDate>Tue, 30 Dec 2008 03:03:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.igvita.com/?p=202#comment-156206</guid>
		<description>Man.. I'm too dumb to understand this M(_ _'')M</description>
		<content:encoded><![CDATA[<p>Man.. I&#8217;m too dumb to understand this M(_ _&#8221;)M</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: CodeWord: Apokalyptik &#187; Blog Archive &#187; A counting bloom filter</title>
		<link>http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/comment-page-1/#comment-155409</link>
		<dc:creator>CodeWord: Apokalyptik &#187; Blog Archive &#187; A counting bloom filter</dc:creator>
		<pubDate>Sun, 28 Dec 2008 10:19:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.igvita.com/?p=202#comment-155409</guid>
		<description>[...] is just me screwing around, really&#8230;. This implements a counting bloom filter in native php. I read about bloom filters this morning, and wrote this tonight in between playing Command and Conquer 3 [...]</description>
		<content:encoded><![CDATA[<p>[...] is just me screwing around, really&#8230;. This implements a counting bloom filter in native php. I read about bloom filters this morning, and wrote this tonight in between playing Command and Conquer 3 [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Cooper</title>
		<link>http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/comment-page-1/#comment-155370</link>
		<dc:creator>Peter Cooper</dc:creator>
		<pubDate>Sun, 28 Dec 2008 07:16:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.igvita.com/?p=202#comment-155370</guid>
		<description>This comes around every couple of years in Ruby land and people enjoy it but then don't find significant utility. Last time: http://www.rubyinside.com/bloom-filters-a-powerful-tool-599.html -- And I know it came around before that too :)

Only thing I've used it in is my WhatLanguage library for detecting language of a text, but there are better ways to do that than a bloom filter anyway :-(</description>
		<content:encoded><![CDATA[<p>This comes around every couple of years in Ruby land and people enjoy it but then don&#8217;t find significant utility. Last time: <a href="http://www.rubyinside.com/bloom-filters-a-powerful-tool-599.html" rel="nofollow">http://www.rubyinside.com/bloom-filters-a-powerful-tool-599.html</a> &#8212; And I know it came around before that too :)</p>
<p>Only thing I&#8217;ve used it in is my WhatLanguage library for detecting language of a text, but there are better ways to do that than a bloom filter anyway :-(</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Thomas Hurst</title>
		<link>http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/comment-page-1/#comment-155305</link>
		<dc:creator>Thomas Hurst</dc:creator>
		<pubDate>Sun, 28 Dec 2008 02:34:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.igvita.com/?p=202#comment-155305</guid>
		<description>Rather than manually passing in &lt;code&gt;m&lt;/code&gt; and &lt;code&gt;k&lt;/code&gt;, you could more usefully ask for a capacity and desired false positive rate:

&lt;code&gt;m = (capacity * Math.log(error) / Math.log(1.0 / 2 ** Math.log(2)).ceil ; 
k = (Math.log(2) * m / capacity).round&lt;/code&gt;

I think I originally got this from &lt;a href="http://www.siaris.net/index.cgi/Programming/LanguageBits/Ruby/BloomFilter.rdoc" rel="nofollow"&gt;Andrew L. Johnson's article and implementation&lt;/a&gt;.</description>
		<content:encoded><![CDATA[<p>Rather than manually passing in <code>m</code> and <code>k</code>, you could more usefully ask for a capacity and desired false positive rate:</p>
<p><code>m = (capacity * Math.log(error) / Math.log(1.0 / 2 ** Math.log(2)).ceil ;<br />
k = (Math.log(2) * m / capacity).round</code></p>
<p>I think I originally got this from <a href="http://www.siaris.net/index.cgi/Programming/LanguageBits/Ruby/BloomFilter.rdoc" rel="nofollow">Andrew L. Johnson&#8217;s article and implementation</a>.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
