Bloom Filters, Min Sketch Count and Min Hashing.
-
Updated
Sep 28, 2019 - Go
Bloom Filters, Min Sketch Count and Min Hashing.
golang implementation of a thread-safe bloomfilter
A Bloom filter implementation in Go
Repository for an article series on probabilistic data structures including Skiplist, bloom filter, counting bloom filter, count sketch, count min sketch etc
Probabilistic data structures for the approximate member query (AMQ) problem in Go.
Cuckoo Filter: Practically better than bloom filter
Simple and efficient bloom filter implementations in Go
A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage.
Bloomfilter written in Golang, includes rotation and RPC
Add a description, image, and links to the probabilistic-data-structures topic page so that developers can more easily learn about it.
To associate your repository with the probabilistic-data-structures topic, visit your repo's landing page and select "manage topics."