We have collection of more than 1 Million open source products ranging from Enterprise product to
small libraries in all platforms. We aggregate information from all open source repositories.
Search and find the best for your needs. Check out projects section.
This project aims to demonstrate a novel bloom filter implementation that canscale, and provide not only the addition of new members, but reliable removalof existing members.Bloom filters are a probabilistic data structure that provide space-efficientstorage of elements at the cost of possible false positive on membershipqueries.**dablooms** implements such a structure that takes additional metadata to classifyelements in order to make an intelligent decision as to which bloom filter an elementshould belong.