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 design uses a user-supplied hash function and salts provided at filter construction time. To determine how many salts are required, call 'SaltsRequired' with the desired filter capacity and false positive percentage. bloom_test.go shows how to do this.
A simple Bloom Filter implementation in Go
Owner
Damian Gryski
Gopher
Similar Resources
A Go implementation of the Elias-Fano encoding
go-ef A Go implementation of the Elias-Fano encoding Example package main import ( "fmt" "github.com/amallia/go-ef" "os" ) func main() {
Nov 23, 2022
Set is a useful collection but there is no built-in implementation in Go lang.
goset Set is a useful collection but there is no built-in implementation in Go lang. Why? The only one pkg which provides set operations now is golang
Sep 26, 2022
A skip list implementation in Go
About This is a library implementing skip lists for the Go programming language (http://golang.org/). Skip lists are a data structure that can be used
Sep 21, 2022
Go implementation of C++ STL iterators and algorithms.
iter Go implementation of C++ STL iterators and algorithms. Less hand-written loops, more expressive code. README translations: 简体中文 Motivation Althou
Dec 19, 2022
Go implementation to calculate Levenshtein Distance.
levenshtein Go package to calculate the Levenshtein Distance The library is fully capable of working with non-ascii strings. But the strings are not n
Dec 14, 2022
A Merkle Tree implementation written in Go.
Merkle Tree in Golang An implementation of a Merkle Tree written in Go. A Merkle Tree is a hash tree that provides an efficient way to verify the cont
Jan 5, 2023
A prefix tree implementation in go
Trie (Prefix tree) This library is compatible with Go 1.11+ Please refer to CHANGELOG.md if you encounter breaking changes. Motivation Introduction Us
Nov 3, 2022
A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
Fast Skiplist Implementation This Go-library implements a very fast and efficient Skiplist that can be used as direct substitute for a balanced tree o
Dec 30, 2022
A slice-based implementation of a stack. In Go!
Stackgo Stackgo is a slice-based implementation of a simple stack in Go. It uses a pre-alloc pagination strategy which adds little memory overhead to
Nov 3, 2022
Related tags
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
Jul 4, 2022
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
Jan 4, 2023
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.
Nov 3, 2022
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
Aug 24, 2022
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.
Jul 4, 2022
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
Dec 30, 2022
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
Dec 28, 2022
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
Jan 4, 2022
A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
Set Set is a simple Set data structure implementation in Go (Golang) using LinkedHashMap. This library allow you to get a set of int64 or string witho
Sep 26, 2022
Go implementation of Count-Min-Log
Count-Min-Log Count-Min-Log sketch: Approximately counting with approximate counters - Guillaume Pitel & Geoffroy Fouquier TL;DR: Count-Min-Log Sketch
Jan 4, 2023