HelixDB: A Graph + Vector Database Built in Rust, Aimed at Collapsing the AI Data Stack Into One Layer

HelixDB is an open-source (Apache 2.0, core repo), YC-backed graph-vector database built from scratch in Rust, designed specifically around AI memory, knowledge graphs, and RAG use cases.

Its core idea: rather than stitching together a vector database for semantic retrieval, a graph database for relationships, and a relational/metadata store — glued together by an application-layer orchestration — HelixDB combines all of it into a single engine. It supports vector search (approximate nearest-neighbor, prefilterable by graph traversal), graph traversal for relationships, BM25 full-text/keyword search, and KV/document/relational data, all queryable through one strongly typed query language (HelixQL). SDKs exist for Python, TypeScript, Rust, and Go, and it has built-in MCP support so agents can traverse the graph directly rather than generating ad-hoc queries.

This combination is particularly relevant for agentic RAG and AI memory use cases — letting a single retrieval call combine semantic similarity, graph relationships, and metadata filters, which is useful for GraphRAG, multi-hop retrieval, agent memory, and enterprise knowledge systems.

Two caveats are worth taking seriously: first, this is a young, fast-moving project (not a drop-in replacement for mature, battle-tested databases without evaluating it against your specific workload) backed by Y Combinator. Second, its storage model differs by deployment: the open-source local path uses in-memory/on-disk storage (LMDB), while the commercial "HelixDB Cloud" offering is built on S3-compatible object storage with auto-scaling and high availability — these are architecturally distinct tiers, not the same system. And on licensing, the main repo is Apache-2.0, but related repos in the same organization carry different, more restrictive licenses (e.g., AGPL-3.0) — so checking the specific component you'd be adopting matters before commercial use.

HelixDB is an open-source (Apache 2.0, core repo), YC-backed graph-vector database built from scratch in Rust, designed specifically around AI memory, knowledge graphs, and RAG use cases.

Its core idea: rather than stitching together a vector database for semantic retrieval, a graph database for relationships, and a relational/metadata store — glued together by an application-layer orchestration — HelixDB combines all of it into a single engine. It supports vector search (approximate nearest-neighbor, prefilterable by graph traversal), graph traversal for relationships, BM25 full-text/keyword search, and KV/document/relational data, all queryable through one strongly typed query language (HelixQL). SDKs exist for Python, TypeScript, Rust, and Go, and it has built-in MCP support so agents can traverse the graph directly rather than generating ad-hoc queries.

This combination is particularly relevant for agentic RAG and AI memory use cases — letting a single retrieval call combine semantic similarity, graph relationships, and metadata filters, which is useful for GraphRAG, multi-hop retrieval, agent memory, and enterprise knowledge systems.

Two caveats are worth taking seriously: first, this is a young, fast-moving project (not a drop-in replacement for mature, battle-tested databases without evaluating it against your specific workload) backed by Y Combinator. Second, its storage model differs by deployment: the open-source local path uses in-memory/on-disk storage (LMDB), while the commercial "HelixDB Cloud" offering is built on S3-compatible object storage with auto-scaling and high availability — these are architecturally distinct tiers, not the same system. And on licensing, the main repo is Apache-2.0, but related repos in the same organization carry different, more restrictive licenses (e.g., AGPL-3.0) — so checking the specific component you'd be adopting matters before commercial use.