18 Resources
Golang bloom Libraries
A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage.
Sprout A bloom filter is a probabilistic data structure that is used to determine if an element is present in a set. Bloom filters are fast and space
A bloom filter is a probabilistic data structure that is used to determine if an element is present in a set
A Go implementation of a bloom filter, with support for boltdb and badgerdb as optional in-memory persistent storage.
Bloomfilter - Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go
Important: Zeroth, consider if a Cuckoo filter could be right for your use-case. Face-meltingly fast, thread-safe, marshalable, unionable, probability
A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.
###blooming-belle - A simple implementation of Bloom Filters What? Bloom filter is a space efficient, probabilistic data structure, designed to test t
Package ring provides a high performance and thread safe Go implementation of a bloom filter.
ring - high performance bloom filter Package ring provides a high performance and thread safe Go implementation of a bloom filter. Usage Please see th
Bloomfilter written in Golang.
go-bloom-filter BloomFilter written in Golang. Implementations This repository contains several bloomfilter implementations that you can use to solve
Sync distributed sets using bloom filters
goSetReconciliation An implementation to sync distributed sets using bloom filters. Based on the paper "Low complexity set reconciliation using Bloom
Leaked password check library with bloom filter
Leaked password check With this library you can check the password is probably leaked or not. Pre generated bitset DB includes 6 Million leaked passwo
Go package implementing Bloom filters
Bloom filters A Bloom filter is a concise/compressed representation of a set, where the main requirement is to make membership queries; i.e., whether
go/golang: fast bit set Bloom filter
package implements a fast bloom filter with real 'bitset' and JSONMarshal/JSONUnmarshal to store/reload the Bloom filter.
高性能的分布式的专门空间优化的 Bitmap 服务, 高效检查数据是否存在,日活统计，签到，打点等等
基于Raft的数据一致性分布式的 bitmap 服务 bitmap(位图)技术是数据库、大数据和互联网业务等场景下经常使用的一种技术。 存在性判断 爬虫url去重 垃圾邮件过滤 用户已阅读 用户已赞 ... 去重 数据库 大数据计算 架构图 支持三种协议读写: HTTP、redcis和rpcx。 写
A simple Bloom Filter implementation in Go
This is a simple Bloom filter implementation written in Go. For the theory behind Bloom filters, read http://en.wikipedia.org/wiki/Bloom_filter This
Go package implementing Bloom filters
Bloom filters A Bloom filter is a representation of a set of n items, where the main requirement is to make membership queries; i.e., whether an item
Package ring provides a high performance and thread safe Go implementation of a bloom filter.
ring - high performance bloom filter Package ring provides a high performance and thread safe Go implementation of a bloom filter. Usage Please see th
Cuckoo Filter: Practically Better Than Bloom
Cuckoo Filter Cuckoo filter is a Bloom filter replacement for approximated set-membership queries. While Bloom filters are well-known space-efficient
Probabilistic data structures for processing continuous, unbounded streams.
Boom Filters Boom Filters are probabilistic data structures for processing continuous, unbounded streams. This includes Stable Bloom Filters, Scalable
Probabilistic set data structure
Your basic Bloom filter Golang probabilistic set data structure A Bloom filter is a fast and space-efficient probabilistic data structure used to test