Skip to content


Repository files navigation


A collection of data structures that are based probability theory and therefore only provide the correct answer if a certain probability. In exchange they have a better runtime and memory complexity compared to traditional data structures.

Build Status Documentation License

The following data structures are implemented:

  • CountMinSketch
  • Filters:
    • BloomFilter
    • CuckooFilter
    • QuotientFilter
  • HyperLogLog
  • ReservoirSampling
  • T-Digest
  • Top-K:
    • CMSHeap
    • LossyCounter


Licensed under either of these:


Unless you explicitly state otherwise, any contribution you intentionally submit for inclusion in the work, as defined in the Apache-2.0 license, shall be dual-licensed as above, without any additional terms or conditions.