This is a stand-alone bloomfilter implementation written in C. Simple but powerful

data structure to store data, rapidly, memory-efficiently and with less collision

A basic implementation of Bloom Filter in C.

A Redis module implementing Bloom filters.

A 'One-Hashing Bloom Filter' implementation

异步并发爬虫

LSM-tree implementation using hash table

A simple and small bloom filter implementation in plain C with persistence extension.

C language crawler including Bloom Filter and PageRank algorithm.

Sampling and Reconstructing using Bloom filters

A spellchecker implemented using a probabilistic data structure

Genome mappability estimation tool

A bloom filter implementation in Rust, using mixing hash function and XXHASH

A header-only bit vector library for C . This can be used for implementing dynamic bit-vectors for building Bloom-Filters and Hyper-Logs .

C program to store and manage voters and votes using a Bloom Filter, a Red-Black Tree and a Singly Linked List (Developed during the Operating Systems K22 course 2019)

Approximating accuracy of prefetcher using Bloom Filter.

An in-memory bloom filter with persistence and HTTP interface

A system managing the voting process of an election using a Self Adjusting Bloom Filter, a Red-Black Tree and a Linked List

Bloom filter

Final project for Olin College Software Systems FA2021. In this project I learned about and implemented a Bloom filter and a bit-sliced document signature in C. I also wrote tests to make sure my implementations worked as expected, and fun demos to show how these data structures can be used. Final project for SP2021 Software Systems.