{"version":"1.0","type":"link","title":"Bloom filter - Newikis","description":"In computing, a Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not – in other words, a query returns either \"possibly…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}