#bloom-filter #probabilistic #mapping #data

sbf

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

7 releases

0.1.6 Dec 10, 2021
0.1.5 Dec 10, 2021
0.1.4 Jul 28, 2020
0.1.3 Oct 22, 2019

#1294 in Data structures

MIT/Apache

26KB
456 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 mirrored in 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;
  • 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

~2.5MB
~47K SLoC