Alternatives
Products that do what CortexDB does
Single-file AI memory and knowledge graph for agents
- 1

- 2HO
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
- 3

We have been using graph DBs more and more at work. I found them painful to work with locally and decided to try and build something better.
12d ago · github.com
- 4

- 5

- 6

- 7

An OKF-backed Model Context Protocol (MCP) server delivering persistent long-term memory and SQLite FTS5 search for AI agents. - fellowgeek/mcp-memory
24d ago · github.com
- 8

- 9

The portable vector database for AI agents beyond the cloud
Apr 2026 · actian.com
- 10AL
Dec 2025 · github.com
- 11SA
Hi HN, We're Luke and Phillip, and we're building Spice.ai OSS - a lightweight, portable runtime, built in Rust and powered by Apache DataFusion to locally materialize, accelerate, and query data tables sourced from any database, data warehouse or data lake. Phillip and I first introduced Spice on Show HN in September 2021. Since then, we’ve been schooled and humbled in every way building 100TB+ data and ML systems for the https://spice.ai cloud platform. Along with our customers, we struggled with getting fast, low-latency, high-concurrency SQL query within a budget, accessing and…
2024 · github.com
- 12

- 13SM
Apr 2026 · github.com
- 14

- 15CO
I keep running in the same problem of each AI app “remembers” me in its own silo. ChatGPT knows my project details, Cursor forgets them, Claude starts from zero… so I end up re-explaining myself dozens of times a day across these apps. The deeper problem 1. Not portable – context is vendor-locked; nothing travels across tools. 2. Not relational – most memory systems store only the latest fact (“sticky notes”) with no history or provenance. 3. Not yours – your AI memory is sensitive first-party data, yet you have no control over where it lives or how it’s queried. Demo video:…
2025 · github.com
- 16

An agent that remembers across sessions can keep its memory as curated markdown files, as an auto-mined structured store, or as trained experience.
22d ago · pinglin.tw
- 17

- 18

- 19

I've been working on Polign and built a small prototype around something I've been thinking about with agent memory. I have built a lightweight/stateless vector db + BM25 search which works really well with typed facts and structured queries. It uses your own S3, or GCS bucket as primary storage, and restarting a node is fairly quick. Demo + writeup: https://polign.com/blog-edge-agent-memory Live search demo: https://demo.polign.com Docs: https://polign.com
11d ago · polign.com
- 20

- 21AM
Vector databases store memories. They don't manage them. After 10k memories, recall quality degrades because there's no consolidation, no forgetting, no conflict resolution. Your AI agent just gets noisier. YantrikDB is a cognitive memory engine — embed it, run it as a server, or connect via MCP. It thinks about what it stores: consolidation collapses duplicate memories, contradiction detection flags incompatible facts, temporal decay with configurable half-life lets unimportant memories fade like human memory does. Single Rust binary. HTTP + binary wire protocol. 2-voter + 1-witness HA…
Apr 2026 · github.com
- 22CB
Hi HN — I’m Prateek Rao. My cofounders and I built Cortexa, which we describe as a Bloomberg terminal for agentic memory. A pattern I keep seeing: when agents misbehave, most teams iterate on prompts and then “fix” it by plugging in a memory layer (vector DB + RAG). That helps sometimes — but it doesn’t guarantee correctness. In practice it often introduces a new failure mode: the agent retrieves something dubious, writes it back to memory as if it’s truth, and that mistake becomes sticky. Over time you get memory pollution, circular hallucination loops, and debugging turns into log…
Mar 2026 · cortexa.ink
- 23PL
How it works: - Storage uses one SQLite database file, plus a local LanceDB index of vectors. No need for a server, cloud services, or any API keys. - Retrieval is a hybrid approach using BM25 (rank-bm25) and vector-based search (sentence-transformers) combined with a co-occurrence graph of entities, using reciprocal rank fusion. The idea is to find the right memory, not the closest one. - It plugs into the agent's lifecycle via MCP: before the agent responds, relevant memories are added to its input; after each turn, decisions and new learnings are automatically recorded. No need to…
Jun 2026 · github.com
- 24HN
Hey HN! We're college friends building HelixDB. It's a database that natively supports both graph and vector types. It’s designed for AI-driven apps like RAG, vector search, code indexing, and agent frameworks where you need both explicit relationships and similarity. We came up with the idea for Helix at university, while building a graph database as a side project in Rust. Reading some research papers on RAG setups, I realised there was a lot of infrastructure setup to get started. You need your own server, a graph database, a vector database and then some bespoke middleman software to…
2025 · github.com
Ranked by how close each launch is in meaning, then by votes. Refine with a description →