A probabilistic data structures library for C#

A class library implementing probabilistic data structures in .NET

A novel, space-efficient, probabilistic data structure for hashing a large number of values. It is similar to a hash table, but smaller because it does not need to store the entire value like HashTable and has better asymptotic performance, at the cost of possible false-positives, a likelihood that is configurable. False negatives are not possib…

.NET client for RedisBloom probabilistic module

Simple load tests for the Redis BloomFilter. Contains results of some tests run with the info about RPS and Latency.

POC for Bloom Filter based Spell Checker

Generic .NET bloom filter library with support for custom hashing functions

A Bloom filter is a probabilistic data structure used to test whether an element is a member of a set. It is highly space-efficient and allows for quick insertions and membership tests. However, it has a small probability of false positives but no false negatives

CSharp Bloom Filter Library

Fun with Bloom filters

Implementation of a basic bloom filter

This Bloom Filter implementation offers probabilistic data structure for fast set membership testing. Efficiently handling large datasets with minimal space, it ensures quick and accurate element existence checks, limits memory usage and retains speed.

Implementation of bloom filter & experimentations on the false positive rate.