enhancement
New feature or request
help wanted
Extra attention is needed
good first issue
Good for newcomers
hacktoberfest
#
bloom-filter
Here are 390 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
Mar 15, 2021 - Go
Probabilistic Datatypes Module for Redis
-
Updated
May 9, 2022 - C
Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)
-
Updated
Jul 5, 2017 - Go
2021年最新总结 500个常用数据结构,算法,算法导论,面试常用,大厂高级工程师整理总结
-
Updated
Aug 27, 2021 - C
In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more
-
Updated
Mar 31, 2021 - Python
Redis for humans. 🌎 🌍 🌏
python
redis
library
cache
bloom-filter
lock
distributed
redis-client
dict
asyncio
forhumans
redis-cache
no-sql
-
Updated
May 2, 2022 - Python
The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.
-
Updated
May 5, 2022 - C
Bloom filter for Scala, the fastest for JVM
-
Updated
Mar 19, 2021 - Scala
LUA Redis scripts for a scaling bloom filter
-
Updated
Oct 23, 2018 - JavaScript
Fast, reliable cuckoo hash table for Node.js.
-
Updated
Oct 18, 2021 - JavaScript
-
Updated
May 12, 2022 - C++
Interesting (non-cryptographic) hashes implemented in pure Python.
python
bloom-filter
python3
hash-functions
hash
hashes-implemented
nilsimsa
geohashes
simhash
duplicates
-
Updated
Sep 3, 2021 - Python
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现,优于布隆过滤器,可以定制化过滤器参数,并进行了空间优化
-
Updated
Mar 22, 2022 - Go
Hashing-function agnostic Cuckoo filters for Redis
-
Updated
Mar 5, 2020 - Zig
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
Mar 30, 2022 - TypeScript
Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
-
Updated
Apr 17, 2019 - Clojure
Java Client for RedisBloom probabilistic module
-
Updated
Jan 10, 2022 - Java
高性能的分布式的专门空间优化的 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
Apr 21, 2022 - 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++
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
-
Updated
Mar 9, 2022 - C++
Verified hash-based AMQ structures in Coq
-
Updated
Apr 13, 2020 - Coq
fastfilter: Binary fuse & xor filters for Zig (faster and smaller than bloom filters)
-
Updated
May 8, 2022 - Zig
-
Updated
Jun 8, 2021 - Elixir
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: