C++ Bloom Filter Library

  •        119

C++ Bloom Filter Library

http://libbloom.codeplex.com/

Tags
Implementation
License
Platform

   




Related Projects

bloom - Go package implementing Bloom filters


A Bloom filter is a representation of a set of n items, where the main requirement is to make membership queries; i.e., whether an item is a member of a set.A Bloom filter has two parameters: m, a maximum size (typically a reasonably large multiple of the cardinality of the set to represent) and k, the number of hashing functions on elements of the set. (The actual hashing functions are important, too, but this is not a parameter for this implementation). A Bloom filter is backed by a BitSet; a key is represented in the filter by setting the bits at each value of the hashing functions (modulo m). Set membership is done by testing whether the bits at each value of the hashing functions (again, modulo m) are set. If so, the item is in the set. If the item is actually in the set, a Bloom filter will never fail (the true positive rate is 1.0); but it is susceptible to false positives. The art is to choose k and m correctly.

BoomFilters - Probabilistic data structures for processing continuous, unbounded streams.


Boom Filters are probabilistic data structures for processing continuous, unbounded streams. This includes Stable Bloom Filters, Scalable Bloom Filters, Counting Bloom Filters, Inverse Bloom Filters, Cuckoo Filters, several variants of traditional Bloom filters, HyperLogLog, Count-Min Sketch, and MinHash.Classic Bloom filters generally require a priori knowledge of the data set in order to allocate an appropriately sized bit array. This works well for offline processing, but online processing typically involves unbounded data streams. With enough data, a traditional Bloom filter "fills up", after which it has a false-positive probability of 1.

python-bloomfilter - Scalable Bloom Filter implemented in Python


P. Almeida, C.Baquero, N. Preguiça, D. Hutchison, Scalable Bloom Filters, (GLOBECOM 2007), IEEE, 2007. Bloom filters are great if you understand what amount of bits you need to set aside early to store your entire set. Scalable Bloom Filters allow your bloom filter bits to grow as a function of false positive probability and size.

opposite_of_a_bloom_filter - Implementations of a data structure with false negatives but no false positives


A Bloom filter is a data structure that may report it contains an item that it does not (a false positive), but is guaranteed to report correctly if it contains the item ("no false negatives"). The opposite of a Bloom filter is a data structure that may report a false negative, but can never report a false positive. That is, it may claim that it has not seen an item when it has, but will never claim to have seen an item it has not.This repository contains thread-safe implementations of "the opposite of a Bloom filter" in Java and Go.


Java-BloomFilter - A stand-alone Bloom filter implementation written in Java


A stand-alone Bloom filter implementation written in Java

pybloomfiltermmap - Fast Python Bloom Filter using Mmap


Fast Python Bloom Filter using Mmap

bloomfilter.js - JavaScript bloom filter using FNV for fast hashing


JavaScript bloom filter using FNV for fast hashing

Python Bloom Filter


A Bloom Filter implementation in pure python, using only the standard library.

Redisson - Redis based In-Memory Data Grid for Java


Redisson - distributed Java objects and services (Set, Multimap, SortedSet, Map, List, Queue, BlockingQueue, Deque, BlockingDeque, Semaphore, Lock, AtomicLong, Map Reduce, Publish / Subscribe, Bloom filter, Spring Cache, Executor service, Tomcat Session Manager, Scheduler service, JCache API) on top of Redis server. Rich Redis client.

dablooms - scaling, counting, bloom filter library


Note: this project has been mostly unmaintained for a while. This project aims to demonstrate a novel Bloom filter implementation that can scale, and provide not only the addition of new members, but reliable removal of existing members.

Bloom: rule-based web loom


Bloom is a great rule-based development framework for websites, web applications and CMSs. Bloom (web-loom) rules promote consistent look and feel and integration of HTML, CSS, JavaScript, data model, etc. Bloom applications are single HTML pages (SPADE).

bloomd - C network daemon for bloom filters


Bloomd is a high-performance C server which is used to expose bloom filters and operations over them to networked clients. It uses a simple ASCII protocol which is human readable, and similar to memcached. Bloom filters are a type of sketching or approximate data structure. They trade exactness for efficiency of representation. Bloom filters provide a set-like abstraction, with the important caveat that they may contain false-positives, meaning they may claim an element is part of the set when it was never in fact added. The rate of false positives can be tuned to meet application demands, but reducing the error rate rapidly increases the amount of memory required for the representation.

KinoBloom - Bloom effect for Unity


Bloom is an image effect for Unity that adds bloom/veiling glare effect to rendered frames. Unity 5.5 or later versions.

bloomd - A high performance C server for bloom filters


A high performance C server for bloom filters

whatlanguage - A language detection library for Ruby that uses bloom filters for speed.


Text language detection. Quick, fast, memory efficient, and all in pure Ruby. Uses Bloom filters for aforementioned speed and memory benefits. It works well on texts of over 10 words in length (e.g. blog posts or comments) and very poorly on short or Twitter-esque text, so be aware. Works with Dutch, English, Farsi, French, German, Italian, Pinyin, Swedish, Portuguese, Russian, Arabic, Finnish, Greek, Hebrew, Hungarian, Korean, Norwegian, Polish and Spanish out of the box.

NSketch, .Net sketch-based algorithms


The NSketch library provides implementations of most common sketch-based algorithms (histograms, quantile, frequent items, bloom filter ...). The library is written in C# for .Net.

ECollections


A project aiming to build drag and drop replacements for .Net collections offerring higher or equivalent performance and significantly lower memory requirements. The project's first deliverables will be a StringDictionary<T> which is a drag and drop replacement for Dictionary<...

shuttler-nessDB


A very fast key-value,embedded Database Storage Engine (Using log-structured-merge (LSM) trees) with Level-LRU, Bloom-Filter,and supports Redis-Protocol(PING,SET,MSET,GET,MGET,DEL,EXISTS,INFO,SHUTDOWN).