|  | 172 |  | 
          
            |  | 173 | --------------------------------------------------------------------------------------------------- | 
          
            |  | 174 | == Boost.!BloomFilters == | 
          
            |  | 175 | * '''Author(s):''' Dean Michael Berris | 
          
            |  | 176 | * '''Version:''' 0.1 | 
          
            |  | 177 | * '''State:''' | 
          
            |  | 178 | * '''Last upload:''' 2009 June 08 | 
          
            |  | 179 | * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/bloom_filter Boost Sandbox] | 
          
            |  | 180 | * '''Categories:''' [#Containers Containers] | 
          
            |  | 181 | * '''Description:'''Bloo Filters | 
          
            |  | 182 |  | 
          
            |  | 183 | A Bloom Filter is a space efficient data-structure that allows you to | 
          
            |  | 184 | represent set membership that allows for false positives (elements may | 
          
            |  | 185 | have been marked as included in a set when they really aren't part of | 
          
            |  | 186 | the set) but not false negatives (when an element has not been | 
          
            |  | 187 | included/added in the set, the bloom filter wouldn't show that they | 
          
            |  | 188 | are part of the set). These have been used in proxy caches to signify | 
          
            |  | 189 | whether they already have a cached copy of a URI. File systems also | 
          
            |  | 190 | use these to see whether a part of a file (or a page) has already been | 
          
            |  | 191 | accessed before (to limit the frequency of fetching pages that have | 
          
            |  | 192 | been fetched before on a DFS for instance). | 
          
            |  | 193 |  | 
          
            |  | 194 | A more in-depth explanation of bloom filters can be found here: | 
          
            |  | 195 | http://en.wikipedia.org/wiki/Bloom_filter | 
          
            |  | 196 |  |