Dev tools · alternatives · 2026

24 alternatives to B-field, a novel probabilistic key-value data structure (`rust-bfield`)

`rust-bfield` is a Rust implementation of our novel "B-field" data structure, which functions like a Bloom filter for key-value lookups instead of set membership queries. The B-field allows you to compactly store data using only a few bytes per key-value pair. We've successfully utilized it in genomics to associate billions of "k-mers" with taxonomic identifiers while maintaining an efficient memory footprint. But the data structure is also useful beyond computational biology, particularly where you have large unique key domains and constrained value ranges. Available under an Apache 2…

B-field is a Rust data structure that functions like a Bloom filter for key-value lookups, storing data using only a few bytes per pair. It is designed for developers working with large datasets and constrained value… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. B-field, a novel probabilistic key-value data structure (`rust-bfield`) launched in 2024; newer entries below may have overtaken it.

1
HelixDB – Open-source vector-graph database for AI applications (Rust)▲237
Hey HN, we want to share HelixDB (https://github.com/HelixDB/helix-db/), a project a college friend and I are working on. It’s a new database that natively intertwines graph and vector types, without sacrificing performance. It’s written in Rust and our initial focus is on supporting RAG. Here’s a video runthrough: https://screen.studio/share/szgQu3yq. Why a hybrid? Vector databases are useful for similarity queries, while graph databases are useful for relationship queries. Each stores data in a way that’s best for its main type of query (e.g.…
2025 · github.com · its alternatives →
2
On-disk B+ tree for Python 3▲159
An on-disk B+tree for Python 3. Contribute to NicolasLM/bplustree development by creating an account on GitHub.
2018 · github.com · its alternatives →
3SA
Shale – a Ruby object mapper and serializer for JSON, YAML and XML▲182
2022 · shalerb.org · its alternatives →
4
A fast HNSW implementation in Rust▲111
HNSW implementation in Rust. Reference: https://arxiv.org/ftp/arxiv/papers/1603/1603.09320.pdf - swapneel/hnsw-rust
2024 · github.com · its alternatives →
5
SeekStorm – open-source sub-millisecond search in Rust▲245
SeekStorm: vector & lexical search - in-process library & multi-tenancy server, in Rust. - SeekStorm/SeekStorm
2024 · github.com · its alternatives →
6
Modeling the human body in Rust so I can cmd+click through it▲46
I started this trying to understand two things: why my Asian friends turn red after drinking, and why several friends all seemed to have migraine clusters. I was reading medical papers and textbooks, but kept getting lost jumping between topics. I thought: what if I could just Cmd+Click through this like code? What if "ALDH2 gene" was actually clickable, and took me to the variant, the phenotype, the population frequencies? So I started modeling human biology in Rust with my Ralph agent (Claude in a loop, ty ghuntley). Turns out the type system is perfect for this. Every biological entity is…
2025 · github.com · its alternatives →
7
Scalable reverse image search built on Kubernetes and Elasticsearch▲139
:crystal_ball: Scalable reverse image search built on Kubernetes and Elasticsearch - dsys/match
2016 · github.com · its alternatives →
8
Parqeye – A CLI tool to visualize and inspect Parquet files▲167
I built a Rust-based CLI/terminal UI for inspecting Parquet files—data, metadata, and row-group-level structure—right from the terminal. If someone sent me a Parquet file, I used to open DuckDB or Polars just to see what was inside. Now I can do it with one command. Repo: https://github.com/kaushiksrini/parqeye
Nov 2025 · github.com · its alternatives →
9
A hash array-mapped trie implementation in C▲171
Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…
2023 · github.com · its alternatives →
10
Minigraf – An embedded, bi-temporal graph database in Rust▲41
Embedded graph memory for AI agents, mobile apps, and the browser. - project-minigraf/minigraf
17d ago · github.com · its alternatives →
11
A Python container for dataclasses with multi-indexing and vector opps▲122
A container for dataclasses with multi-indexing and bulk operations. - joshlk/dataclassframe
2020 · github.com · its alternatives →
12AF
Apache Fory Rust – 10-20x faster serialization than JSON/Protobuf▲67
Serialization framework with some interesting numbers: 10-20x faster on nested objects than json/protobuf. Technical approach: compile-time codegen (no reflection), compact binary protocol with meta-packing, little-endian layout optimized for modern CPUs. Unique features that other fast serializers don't have: - Cross-language without IDL files (Rust ↔ Python/Java/Go) - Trait object serialization (Box) - Automatic circular reference handling - Schema evolution without coordination Happy to discuss design trade-offs. Benchmarks:…
Oct 2025 · fory.apache.org · its alternatives →
13
Typed-arrow – compile‑time Arrow schemas for Rust▲48
Hi community, we just released https://github.com/tonbo-io/typed-arrow. When working with arrow-rs, we noticed that schemas are declared at runtime. This often leads to runtime errors and makes development less safe. typed-arrow takes a different approach: - Schemas are declared at compile time with Rust’s type system. - This eliminates runtime schema errors. - And introduces no runtime overhead — everything is checked and generated by the compiler. If you’ve run into Arrow runtime schema issues, and your schema is stable (not defined or switched at runtime), this project…
2025 · github.com · its alternatives →
14
Rust framework for advanced file recognition and identification▲46
Alternative to magic.h and infer. Zero dependencies. Fully extensible. Works in no_std, async, and embedded contexts.
2025 · crates.io · its alternatives →
15
KiviDB, a faster Redis-compatible memory database and vector cache▲69
A fast, multi-threaded Redis® and Valkey alternative written in Rust: drop-in compatible, with full-text and vector search built in - kividbio/kividb
3d ago · github.com · its alternatives →
16
I made an open-source Rust program for memory-efficient genomics▲17
My cofounder and I run a startup in oncology, where we handle cancer genomics data. It occurred to me that, thanks to a recent complexity theory result, there's a clever way to run bioinformatics algorithms using far less RAM. I built this Rust engine for running whole-genome workloads in under 100MB of RAM. Runtime is a little longer as a result - O(TlogT) instead of O(T). But it should enable whole-genome analytics on consumer-grade hardware.
Nov 2025 · github.com · its alternatives →
17
I Wrote a Book on Data Analysis with Rust Notebooks▲105
A practical book on Data Analysis with Rust Notebooks that teaches you the concepts and how they’re implemented in practice.
2020 · datacrayon.com · its alternatives →
18
Bloop – Declarative Modeling for DynamoDB▲16
Object Mapper for DynamoDB. Contribute to numberoverzero/bloop development by creating an account on GitHub.
2015 · github.com · its alternatives →
19
HelixDB▲105
An open-source OLTP graph-vector database built in Rust.
Feb 2026 · helix-db.com · its alternatives →
20
A first project in Rust – in-memory order book▲91
Contribute to connorwstein/exchange development by creating an account on GitHub.
2020 · github.com · its alternatives →
21
Minikv – Distributed key-value and object store in Rust (Raft, S3 API)▲71
Hi HN, I'm Emilie, I have a literature background (which explains the well-written documentation!) and I've been learning Rust and distributed systems by building minikv over the past few months. It recently got featured in Programmez! magazine: https://www.programmez.com/actualites/minikv-un-key-value-st... minikv is an open-source, distributed storage engine built for learning, experimentation, and self-hosted setups. It combines a strongly-consistent key-value database (Raft), S3-compatible object storage, and basic multi-tenancy. Features/highlights: - Raft…
Feb 2026 · github.com · its alternatives →
22
Cuckoo Filter in Ruby▲74
Pure Ruby Cuckoo Filter Implementation. Contribute to pawandubey/cuckoo_filter development by creating an account on GitHub.
2017 · github.com · its alternatives →
23
BloomSearch – Keyword search with hierarchical Bloom filters▲66
Hey HN! I got nerd-sniped by Bloom Filters this weekend, specifically for searching datasets with high "cardinality" (number of unique items). They're an _amazing_ data structure that, at a fixed size, tracks potential set membership. That means unlike normal b-tree indexes, they don't grow with the number of unique items in the dataset. This makes them great for "needle in a haystack" search (logs, document) as implementations like VictoriaMetrics and Bing's BitFunnel show. I've used them in the past, but they've never been center-stage in my projects. I wanted high cardinality keyword…
2025 · github.com · its alternatives →
24
An experimental distributed SQL database from scratch in Go▲104
LBADD: An experimental, distributed SQL database. Contribute to tomarrell/lbadd development by creating an account on GitHub.
2019 · github.com · its alternatives →

Also compare

Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →