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 <[EMAIL PROTECTED]> wrote:
> Can some one give a simple analogy of Bloom Filter in SQL.
> I am trying to understand and always get confused.