COLLECTED BY
Organization:
Internet Archive
Focused crawls are collections of frequently-updated webcrawl data from narrow (as opposed to broad or wide) web crawls, often focused on a single domain or subdomain.
The Wayback Machine - https://web.archive.org/web/20200806182812/https://github.com/topics/bloom-filter
Here are
290 public repositories
matching this topic...
Probabilistic data structures for processing continuous, unbounded streams.
🔍 Tiny, full-text search engine for static websites built with Rust and Wasm
Updated
Jul 20, 2020
Rust
Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)
Probabilistic Datatypes Module for Redis
In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more
Updated
Dec 31, 2019
Python
Bloom filter for Scala, the fastest for JVM
Updated
Apr 28, 2020
Scala
🎯 Bloom filters for C++11
Fast, reliable cuckoo hash table for Node.js.
Updated
Jul 27, 2020
JavaScript
LUA Redis scripts for a scaling bloom filter
Updated
Oct 23, 2018
JavaScript
The dream fast hash function and random number generators that passed SMHasher, BigCrush and practrand.
Interesting (non-cryptographic) hashes implemented in pure Python.
Updated
Mar 8, 2018
Python
🔬 Assemble large genomes using short reads
A simple and small bloom filter implementation in plain C.
Hashing-function agnostic Cuckoo filters for Redis
Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
Updated
Apr 17, 2019
Clojure
Data-Structures using C++.
Swift Collection Data Structures Library
Updated
Jan 20, 2019
Swift
A Minimal Perfect Hash Function Library
Updated
Oct 15, 2019
Java
Verified hash-based AMQ structures in Coq
Study group for algorithms in Ruby, hosted at App Academy
Updated
Jan 19, 2016
Ruby
Proof of Work with SHA256 and Bloom filter
Updated
Jul 26, 2018
JavaScript
🌺 A pure Elixir implementation of Scalable Bloom Filters
Updated
Jun 14, 2020
Elixir
Java Client for RedisBloom probabilistic module
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Updated
Jul 31, 2020
TypeScript
Probabilistic set data structure
A probabilistic data structures library for C#
A class library implementing probabilistic data structures in .NET
Improve this page
Add a description, image, and links to the
bloom-filter
topic page so that developers can more easily learn about it.
Curate this topic
Add this topic to your repo
To associate your repository with the
bloom-filter
topic, visit your repo's landing page and select "manage topics."
Learn more
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session.
You signed out in another tab or window. Reload to refresh your session.