Erik-Jan van Baaren » math http://www.eriky.com Just another geek with a blog Fri, 07 May 2010 19:13:28 +0000 en hourly 1 http://wordpress.org/?v=3.0.1 Bloom filters http://www.eriky.com/2009/03/bloom-filters http://www.eriky.com/2009/03/bloom-filters#comments Tue, 03 Mar 2009 22:19:11 +0000 Erik-Jan http://www.eriky.com/?p=93 This article by Broder and Mitzenmacher gives a good description of how bloom filters work and what they can do for you. The bloom filter basically replaces a dataset with a filter that can tell you if an item is a member of that set or not. It will not give false negatives, but it might give false positives. In practise, this is a negative property that can be outweighted by the space savings a bloom filter introduces; after all, you do not need to query the dataset to determine membership. The most important and summarizing quote you should remember from the article:

The Bloom filter principle: Wherever a list or set is used, and space is at a premium, consider using a Bloom filter if the effect of false positives can be mitigated.

The article also gives a number of examples in which bloom filters are used. E.g. to aid resource location in P2P and cache systems.

]]> http://www.eriky.com/2009/03/bloom-filters/feed 0