skip to navigation
skip to content

BloomFilter 0.1.0

A simple implement of bloom filter

Introduction

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, thus a Bloom filter has a 100% recall rate. In other words, a query returns either “possibly in set” or “definitely not in set”.

A very simple implement of bloom filter

 
File Type Py Version Uploaded on Size
BloomFilter-0.1.0.tar.gz (md5) Source 2014-12-05 1KB