Skip to content

Rust implementation of a probabilistic multiset cardinality algorithm

License

Notifications You must be signed in to change notification settings

alexhholmes/inbloom

Folders and files

NameName
Last commit message
Last commit date

Latest commit

e3bbfa7 · Nov 16, 2024

History

27 Commits
Nov 16, 2024
Nov 10, 2024
Nov 10, 2024
Nov 10, 2024
Nov 10, 2024
Nov 16, 2024

Repository files navigation

InBloom

A Rust implementation of the HyperLogLog algorithm. This is used to estimate the cardinality of a multiset, or in other words, estimate the number of distinct elements in a multiset. The implementation is inspired by cloudflare/trie-hard.

Based on the research paper HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm by Philippe Flajolet, Éric Fusy, Olivier Gandouet, and Frédéric Meunier.

Additionally, the following papers are referenced:

  • Loglog Counting of Large Cardinalities (Extended Abstract)
  • HyperLogLog in Practice: Algorithmic Engineering of a State of The Art Cardinality Estimation Algorithm
  • LogLog-Beta and More: A New Algorithm for Cardinality Estimation Based on LogLog Counting

Usage

Benchmarks

About

Rust implementation of a probabilistic multiset cardinality algorithm

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages