Probabilistic data structures (bloom filter / counting bloom filter / linear counter)
-
Updated
Jul 20, 2024 - Elixir
Probabilistic data structures (bloom filter / counting bloom filter / linear counter)
Probabilistic Datatypes Module for Redis
🔬 Assemble large genomes using short reads
Bloom Filters basic implementation in javascript
WebPKI-level Certificate Revocation via Multi-Level Bloom Filter Cascade
Redis for humans. 🌎🌍🌏
Fully asynchronous, pure JavaScript implementation of the Parquet file format with additional features
BM25 algorithm using bloom filters in inverted index to allow fast querying of high-df tokens.
A HIDS (host-based intrusion detection system) for verifying the integrity of a system.
BloomFilter is a simple and efficient implementation of a Bloom filter in Go.
A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.
advanced programming course focused on C++ programming (C++23)
Making a multi-model database from scratch | For educational purposes only
fast, extensible, versatile event router for Suricata's EVE-JSON format
An lightweight Bloom Filter implementation in Rust
Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 26GB/s + PRNG
Lightweight Bloom filter data structure derived from the built-in bytearray type.
bloom filter driven Go library for checking passwords against common password lists
Extremely fast Bloom filters for Go
Add a description, image, and links to the bloom-filter topic page so that developers can more easily learn about it.
To associate your repository with the bloom-filter topic, visit your repo's landing page and select "manage topics."