Dev tools · alternatives · 2026
24 alternatives to Slater
Low-RAM fast graph DB designed for local replica graphs.
Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1
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
Hey HN, it’s been just over a year since we launched HelixDB (https://news.ycombinator.com/item?id=43975423), a project a friend and I started in college. It’s an OLTP graph database built on object-storage, with native vector search and full-text search (FTS). Why graph, vector and FTS? Graph databases provide a natural cognitive model for data, vectors allow for a semantic understanding of the entities and relationships in the graph, and FTS provides more specific filtering. Many AI-driven applications attempt to combine all of these functionalities by stitching together…
Jun 2026 · github.com · its alternatives →
- 3
- 4
Fast key-value DB in Go. Contribute to dgraph-io/badger development by creating an account on GitHub.
2017 · github.com · its alternatives →
- 5TA
2020 · terminusdb.com · its alternatives →
- 6
Hey there HN! We’re Antonio, Luca, and Yuhang, and we’re excited to introduce Fast GraphRAG, an open-source RAG approach that leverages knowledge graphs and the 25 years old PageRank for better information retrieval and reasoning. Building a good RAG pipeline these days takes a lot of manual optimizations. Most engineers intuitively start from naive RAG: throw everything in a vector database and hope that semantic search is powerful enough. This can work for use cases where accuracy isn’t too important and hallucinations are tolerable, but it doesn’t work for more difficult queries that…
2024 · github.com · its alternatives →
- 7
Stellate is now open for everybody with edge caching, query analytics, error tracking and protection from malicious queries for your GraphQL APIs.
2021 · graphcdn.io · its alternatives →
- 8IB
We show the potential of modern, embedded graph databases in the browser by demonstrating a fully in-browser chatbot that can perform Graph RAG using Kuzu (the graph database we're building) and WebLLM, a popular in-browser inference engine for LLMs. The post retrieves from the graph via a Text-to-Cypher pipeline that translates a user question into a Cypher query, and the LLM uses the retrieved results to synthesize a response. As LLMs get better, and WebGPU and Wasm64 become more widely adopted, we expect to be able to do more and more in the browser in combination with LLMs, so a lot of…
2025 · blog.kuzudb.com · its alternatives →
- 9
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
Aug 2026 · polign.com · its alternatives →
- 10
A distributed, fast open-source graph database featuring horizontal scalability and high availability - GitHub - vesoft-inc/nebula: A distributed, fast open-source graph database featuring horizontal scalability and high availability
2020 · github.com · its alternatives →
- 11
Memgraph 1.0 is now production-ready, offering high-performance, in-memory graph database with Cypher support.
2020 · memgraph.com · its alternatives →
- 12
Python library for embedding large graphs in 2D space, using force-directed layouts. - H4kor/graph-force
2022 · github.com · its alternatives →
- 13WH
2022 · memgraph.com · its alternatives →
- 14
- 15
Hey HN! We're Paul, Preston, and Daniel from Zep. We've just open-sourced Graphiti, a Python library for building temporal Knowledge Graphs using LLMs. Graphiti helps you create and query graphs that evolve over time. Knowledge Graphs have been explored extensively for information retrieval. What makes Graphiti unique is its ability to build a knowledge graph while handling changing relationships and maintaining historical context. At Zep, we build a memory layer for LLM applications. Developers use Zep to recall relevant user information from past conversations without including the entire…
2024 · github.com · its alternatives →
- 16
Hi HN, I have been working with regulation-heavy documents lately, and one thing kept bothering me. Flat RAG pipelines often fail to retrieve related articles together, even when they are clearly connected through references, definitions, or clauses. After trying several RAG setups, I subjectively felt that GraphRAG was a better mental model for this kind of data. The Microsoft GraphRAG paper and reference implementation were helpful starting points. However, in practice, I found one recurring friction point: graph storage and vector indexing are usually handled by separate systems, which…
Jan 2026 · github.com · its alternatives →
- 17
Embedded graph memory for AI agents, mobile apps, and the browser. - project-minigraf/minigraf
19d ago · github.com · its alternatives →
- 18
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 · its alternatives →
- 19
- 20AG
This is a vector index I built that supports insertion and k-nearest neighbors (k-NN) querying, optimized for GPUs. It operates entirely in CUDA and can process queries on half a billion vectors in under 200 milliseconds. The codebase is structured as a standalone library with an HTTP API for remote access. It’s intended for high-performance search tasks—think similarity search, AI model retrieval, or reinforcement learning replay buffers. The codebase is located at https://github.com/rodlaf/BinaryGPUIndex.
2025 · rlafuente.com · its alternatives →
- 21
A graph based REPL that saves to and loads from disk - incrediblesound/Graph-Reply
2015 · github.com · its alternatives →
- 22SA
Hi everyone, I've made an open-source library for fast spatial search in Rust. It's called Spart, and it currently provides the following features: - Five tree implementations: Quadtree, Octree, Kd-tree, R-tree, and R*-tree - Python bindings (`pyspart` on PyPI) - Fast k-nearest neighbor (kNN) and radius search - Bulk data loading for efficient tree construction Project's GitHub repo: https://github.com/habedi/spart
2025 · its alternatives →
- 23
Hi HN, I am one of the cofounders of http://turingdb.ai. We built TuringDB while working on large biological knowledge graphs and graph-based digital twins with pharma & hospitals, where existing graph databases were unusable for deep graph traversals with hundreds or thousands of hops on (crappy) machines you can find in a hospital. https://github.com/turing-db/turingdb TuringDB is a new in-memory, column-oriented graph database optimised for read-heavy analytical workloads: - Milliseconds (1) for multi-hop queries on graphs with 10M+ nodes/edges -…
Jan 2026 · github.com · its alternatives →
- 24
Tell MemorySync a fact, reload the page, then ask for it back in your own words. No signup. Every API call shown in cURL, Python and Node.js.
11d ago · memorysync.io · its alternatives →
Also compare
- HelixDB – Open-source vector-graph database for AI applications (Rust) alternatives
- HelixDB – A graph database built on object storage alternatives
- GraphFast alternatives
- Badger – an embeddable, persistent key-value store written in Go alternatives
- TerminusDB – An open source in-memory graph database alternatives
- FastGraphRAG – Better RAG using good old PageRank alternatives
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 →