Get the latest tech news
Show HN: B-field, a novel probabilistic key-value data structure (`rust-bfield`)
B-field implementation in Rust. Contribute to onecodex/rust-bfield development by creating an account on GitHub.
Specifically, B-fields exhibit a unique combination of properties that makes them ideal for storing very large sets of keys mapped to a modest number of discrete values: While many of the implementation details that follow will be familiar to those acquainted with hash-based data structures in general and Bloom filters specifically, the B-field is designed for storing key-value pairs rather than simple set membership information. In this case, we$\mathtt{DECODE}$ the resulting bit string (simply the inverse of the$\mathtt{ENCODE}$ operation detailed in Figure 1) and the value$y_{i}$ mapping to the key$x_{i}$ is returned.
Or read this on Hacker News
