Probabilistic Data Structures in Go

Work in progress

This repository contains implementations of probabilistic data structures in Go.

Feature Roadmap

• Hash functions
  • Murmur3 (32-bit)
  • FNV1 (64-bit)
• Membership
  • Bloom filter
  • Quotient filter
  • Cuckoo filter
• Cardinality
  • HyperLogLog
• Frequency
  • Count-min sketch
• Rank
  • q-digest
  • t-digest
• Similarity
  • Locality-sensitive hashing

Thread-safe and optimized implementations will be added in the future.

Examples

Examples are available in the examples directory.

Contributing

If you have any suggestions or feedback, please feel free to open an issue or a PR.