The Bloom filter, conceived by Burton H. Bloom in 1970, is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.
BloomFilter is a new Ruby library by Bryan Duxbury that provides operations to create and query “bloom filters”, an extremely space-efficient “probablistic data structure” that makes it quick and easy to test set membership.
I'm Federico Feroldi, a visionary developer and technology enthustiast. This blog will follow my latest projects and interests about my life and my job. I hope you'll enjoy and contribute with your comments.