#
bloom-filter
Here are 314 public repositories matching this topic...
Probabilistic data structures for processing continuous, unbounded streams.
go
filter
data-stream
bloom-filter
count-min-sketch
probabilistic-programming
cuckoo-filter
scalable-bloom-filters
counting-bloom-filters
stable-bloom-filters
-
Updated
May 20, 2020 - Go
Probabilistic Datatypes Module for Redis
-
Updated
Feb 22, 2021 - C
Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)
-
Updated
Jul 5, 2017 - Go
In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more
-
Updated
Feb 22, 2021 - Python
Bloom filter for Scala, the fastest for JVM
-
Updated
Apr 28, 2020 - Scala
The dream fast hash function and random number generators that passed SMHasher, BigCrush and practrand.
-
Updated
Feb 20, 2021 - C
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
-
Updated
Jan 25, 2021 - C++
Interesting (non-cryptographic) hashes implemented in pure Python.
python
bloom-filter
python3
hash-functions
hash
hashes-implemented
nilsimsa
geohashes
simhash
duplicates
-
Updated
Mar 8, 2018 - Python
Hashing-function agnostic Cuckoo filters for Redis
-
Updated
Mar 5, 2020 - Zig
Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
-
Updated
Apr 17, 2019 - Clojure
高性能的分布式的专门空间优化的 Bitmap 服务, 高效检查数据是否存在,日活统计,签到,打点等等
-
Updated
Aug 13, 2020 - Go
Blockchain as intended
c-plus-plus
blockchain
bloom-filter
financial
qwt
qt5
mining
cryptocurrency
distro
wallet
cryptocurrencies
automake
blockchain-wallet
blockchain-technology
blockchain-platform
bdb
cplusplus-17
mining-pool
gulden
fpic
-
Updated
Feb 19, 2021 - C++
Data-Structures using C++.
hashing
data-structure
linked-list
graphs
bloom-filter
trie
hash
recursion
data-structures
binary-search-tree
string-manipulation
binary-tree
binary-trees
bst
trees
stacks
heaps
queues
leaf-nodes
trie-template
-
Updated
Oct 28, 2020 - C++
Verified hash-based AMQ structures in Coq
-
Updated
Apr 13, 2020 - Coq
Java Client for RedisBloom probabilistic module
-
Updated
Feb 3, 2021 - Java
A Minimal Perfect Hash Function Library
-
Updated
Feb 20, 2021 - Java
Swift Collection Data Structures Library
swift
stack
queue
graph
cocoapods
carthage
matrix
swift-package-manager
bloom-filter
bitarray
trie
priority-queue
multiset
swift-3
bimap
circular-buffer
deque
multimap
-
Updated
Jan 20, 2019 - Swift
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
hll
threadsafe
bloom-filter
simd
python-bindings
minhash
count-min-sketch
hyperloglog
simd-parallelism
sketch-data-structures
superminhash
count-sketch
ntcard
-
Updated
Feb 19, 2021 - C++
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
javascript
bloom-filter
minhash
count-min-sketch
cuckoo-filter
hyperloglog
probabilistic
topk
invertible-bloom-filter
-
Updated
Nov 25, 2020 - TypeScript
Study group for algorithms in Ruby, hosted at App Academy
algorithm
compression
a-frame
strings
bloom-filter
bit-manipulation
computation
hash-map
edit-distance
lempel-ziv
huffman-coding
-
Updated
Jan 19, 2016 - Ruby
-
Updated
Jun 14, 2020 - Elixir
C++ Bloom Filter Library
-
Updated
Nov 21, 2020 - C++
A probabilistic data structures library for C#
c-sharp
csharp
bloom-filter
count-min-sketch
cuckoo-filter
hyperloglog
scalable-bloom-filters
counting-bloom-filters
stable-bloom-filters
probabilistic-data-structures
-
Updated
Jun 5, 2018 - C#
Improve this page
Add a description, image, and links to the bloom-filter topic page so that developers can more easily learn about it.
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."
People are interested in a size-comparison between
If anyone wants to do a comparison, post a comment here.
Some ideas: