bloom

BSD-2-ClauseGo1.2.4

A fast and space-efficient probabilistic set data structure for Go that tests membership with 'likely member' or 'definitely not member' results.

88 stars9 forks0 contributors

Overview

Probabilistic set data structure

Community-curated · Updated weekly · 100% open source

Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.

9 years ago

CreatedSince 2017

Auto-fetched 1 day ago

Go package implementing Bloom filters, used by Milvus and Beego.

Probabilistic data structures for processing continuous, unbounded streams.

Cuckoo Filter: Practically Better Than Bloom

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化