Extremely fast Bloom filters for Go
-
Updated
Jun 18, 2024 - Go
Extremely fast Bloom filters for Go
Go package implementing Bloom filters, used by Milvus and Beego.
Simple Private Set Intersection implemented in pure Go.
Implementing a Cuckoo filter, based on the paper Cuckoo Filter: Practically Better Than Bloom
A scalable bloom filter service in Golang
Go: A distributed, in-memory key-value storage.
Go implementation of probabilistic high-performance data structure allowing for unknown-size data or stream input.
Golang Bloom Filter implementation
Add a description, image, and links to the bloom-filters topic page so that developers can more easily learn about it.
To associate your repository with the bloom-filters topic, visit your repo's landing page and select "manage topics."