[prev in list] [next in list] [prev in thread] [next in thread] 

List:       hadoop-user
Subject:    Re: Bloom Filter analogy in SQL
From:       Ted Dunning <tdunning () maprtech ! com>
Date:       2013-03-30 6:31:23
Message-ID: CAND0qzvREpEfHECO7dKWMkWjXVuPX1=pBcp0jad2ZFGsqEx62Q () mail ! gmail ! com
[Download RAW message or body]

This isn't a very Hadoop question.

A Bloom filter is a very low level data structure that doesn't really any
correlate in SQL.  It allows you to find duplicates quickly and
probabilistically.  In return for a small probability of a false positive,
it uses less memory.


On Fri, Mar 29, 2013 at 5:36 PM, Sai Sai <saigraph@yahoo.in> wrote:

> Can some one give a simple analogy of Bloom Filter in SQL.
> I am trying to understand and always get confused.
> Thanks
>

[Attachment #3 (text/html)]

<div dir="ltr"><br><div style>This isn&#39;t a very Hadoop question.</div><div \
style><br></div><div style>A Bloom filter is a very low level data structure that \
doesn&#39;t really any correlate in SQL.  It allows you to find duplicates quickly \
and probabilistically.  In return for a small probability of a false positive, it \
uses less memory.</div>

</div><div class="gmail_extra"><br><br><div class="gmail_quote">On Fri, Mar 29, 2013 \
at 5:36 PM, Sai Sai <span dir="ltr">&lt;<a href="mailto:saigraph@yahoo.in" \
target="_blank">saigraph@yahoo.in</a>&gt;</span> wrote:<br><blockquote \
class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc \
solid;padding-left:1ex">

<div><div style="font-size:12pt;font-family:times new roman,new \
york,times,serif"><div>Can some one give a simple analogy of Bloom Filter in \
SQL.</div><div>I am trying to understand and always get \
confused.</div><div>Thanks</div>

  </div></div></blockquote></div><br></div>



[prev in list] [next in list] [prev in thread] [next in thread]