#probabilistic #mapping #bloom-filter #data

sbf-blake3

Spatial Bloom Filter, a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space

1 unstable release

0.2.0 Jan 18, 2022

#1954 in Data structures

MIT/Apache

27KB
479 lines

Spatial Bloom Filter

pipeline status coverage report Crate API

SBF is a probabilistic data structure that maps elements of a space to indexed disjoint subsets of that space.

This is a reimplementation of the C library by the original research group.

This repository is forked from GitLab and Github

Crate features

This crate allows the following features:

  • md4_hash Allows to use a md4 based hashing algorithm;
  • md5_hash Allows to use a md5 based hashing algorithm;
  • blake3_hash Allows to use a Blake3 based hashing algorithm;
  • serial Enables serde integration;
  • metrics Generates and updates an internal metrics object, useful in simulations and benchmarks of the library.

By default only md5_hash is enabled.

Dependencies

~1.9–2.8MB
~56K SLoC