Bloomfilter written in Golang, includes rotation and RPC
-
Updated
Sep 18, 2024 - Go
#
probabilistic-data-structures
Here are 12 public repositories matching this topic...
Cuckoo Filter: Practically better than bloom filter
-
Updated
May 2, 2019 - Go
A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage.
-
Updated
Mar 5, 2022 - Go
Sliding-window and regular top-K sketches, based on HeavyKeeper
go golang sketch top-k probabilistic-data-structures sliding-window heavy-hitters heavykeeper heavy-keeper
-
Updated
Apr 30, 2025 - Go
Simple and efficient bloom filter implementations in Go
-
Updated
Sep 26, 2018 - Go
Repository for an article series on probabilistic data structures including Skiplist, bloom filter, counting bloom filter, count sketch, count min sketch etc
-
Updated
Feb 24, 2023 - Go
golang implementation of a thread-safe bloomfilter
-
Updated
Jan 2, 2020 - Go
A Bloom filter implementation in Go
-
Updated
Jan 9, 2024 - Go
Probabilistic data structures for the approximate member query (AMQ) problem in Go.
-
Updated
Jan 17, 2022 - Go
Probabilistic data structures implemented in Go.
go golang bloom-filter murmurhash3 t-digest locality-sensitive-hashing count-min-sketch murmur3 cuckoo-filter hyperloglog probabilistic-data-structures data-structures-and-algorithms fnv1
-
Updated
Jun 1, 2025 - Go
A set of probabilistic data structures
-
Updated
Jan 10, 2025 - Go
Bloom Filters, Min Sketch Count and Min Hashing.
-
Updated
Sep 28, 2019 - Go
Improve this page
Add a description, image, and links to the probabilistic-data-structures topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the probabilistic-data-structures topic, visit your repo's landing page and select "manage topics."