bloom-filter
Here are 74 public repositories matching this topic...
Thread-safe and persistent Golang implementations of probabilistic data structures: Bloom Filter, Cuckoo Filter, HyperLogLog, Count-Min Sketch and Top-K
-
Updated
Jan 21, 2024 - Go
bloomfilter data structure implemented in go as a package.
-
Updated
Oct 4, 2020 - Go
A Bloom filter implementation in Go
-
Updated
Apr 2, 2021 - Go
A library for caching using Bloom Filter on any database
-
Updated
Dec 25, 2023 - Go
Go package that provides an implementation of a Bloom filter
-
Updated
Feb 21, 2024 - Go
-
Updated
Apr 19, 2022 - Go
A Golang multi-level caching framework based on Redis and local memory for distributed scenarios.
-
Updated
May 10, 2024 - Go
Fast bloom filter library written in Go
-
Updated
Oct 18, 2023 - Go
a high performance bloom filter, using uint64 array & murmurhash3.
-
Updated
Apr 17, 2017 - Go
A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.
-
Updated
May 3, 2017 - Go
Go implementation of probabilistic high-performance data structure allowing for unknown-size data or stream input.
-
Updated
Jan 5, 2018 - Go
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."