Implementation of a basic bloom filter

CSharp Bloom Filter Library

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

POC for Bloom Filter based Spell Checker

A probabilistic data structures library for C#

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

.NET client for RedisBloom probabilistic module

Fun with Bloom filters

A class library implementing probabilistic data structures in .NET

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

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.

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

Implementation of Some popular probabilistic data structures in dotnet

After building the project in go, also build it using ASP.NET Core. The soul purpose of these projects was to try new technologies used in bigger companies for scalability.

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…