AI · alternatives · 2026

24 alternatives to GibRAM an in-memory ephemeral GraphRAG runtime for retrieval

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…

GibRAM is an in-memory GraphRAG runtime designed for retrieving connected information from regulation-heavy documents. Unlike traditional RAG systems that struggle to link related articles together, GibRAG builds a… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.

1
FastGraphRAG – Better RAG using good old PageRank▲457
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 →
2
I replaced vector databases with Git for AI memory (PoC)▲198
Hey HN! I built a proof-of-concept for AI memory using Git instead of vector databases. The insight: Git already solved versioned document management. Why are we building complex vector stores when we could just use markdown files with Git's built-in diff/blame/history? How it works: Memories stored as markdown files in a Git repo Each conversation = one commit git diff shows how understanding evolves over time BM25 for search (no embeddings needed) LLMs generate search queries from conversation context Example: Ask "how has my project evolved?" and it uses git diff to show actual…
2025 · github.com · its alternatives →
3
SpRAG – Open-source RAG implementation for challenging real-world tasks▲69
Hey HN, I’m Zach from Superpowered AI (YC S22). We’ve been working in the RAG space for a little over a year now, and we’ve recently decided to open-source all of our core retrieval tech. spRAG is a retrieval system that’s designed to handle complex real-world queries over dense text, like legal documents and financial reports. As far as we know, it produces the most accurate and reliable results of any RAG system for these kinds of tasks. For example, on FinanceBench, which is an especially challenging open-book financial question answering benchmark, spRAG gets 83% of questions correct,…
2024 · github.com · its alternatives →
4IB
In-Browser Graph RAG with Kuzu-WASM and WebLLM▲158
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 →
5
PageIndex – Vectorless RAG▲192
Not all improvements come from adding complexity — sometimes it's about removing it. PageIndex takes a different approach to RAG. Instead of relying on vector databases or artificial chunking, it builds a hierarchical tree structure from documents and uses reasoning-based tree search to locate the most relevant sections. This mirrors how humans approach reading: navigating through sections and context rather than matching embeddings. As a result, the retrieval feels transparent, structured, and explainable. It moves RAG away from approximate "semantic vibes" and toward explicit reasoning…
2025 · github.com · its alternatives →
6
Graphiti – LLM-Powered Temporal Knowledge Graphs▲142
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 →
7
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 →
8
Turn any website into a knowledge base for LLMs▲305
I built this tool because I wanted a way to just take a bunch of URLs or domains, and query their content in RAG applications. It takes away the pain of crawling, extracting content, chunking, vectorizing, and updating periodically. I'm curious to see if it can be useful to others. I meant to launch this six months ago but life got in the way...
2024 · embedding.io · its alternatives →
9WS
We scaled Git to support 1 TB repos▲279
I’ve been in the MLOps space for ~10 years, and data is still the hardest unsolved open problem. Code is versioned using Git, data is stored somewhere else, and context often lives in a 3rd location like Slack or GDocs. This is why we built XetHub, a platform that enables teams to treat data like code, using Git. Unlike Git LFS, we don’t just store the files. We use content-defined chunking and Merkle Trees to dedupe against everything in history. This allows small changes in large files to be stored compactly. Read more here:…
2022 · xethub.com · its alternatives →
10
Chonkie – A Fast, Lightweight Text Chunking Library for RAG▲199
I built Chonkie because I was tired of rewriting chunking code for RAG applications. Existing libraries were either too bloated (80MB+) or too basic, with no middle ground. Core features: - 21MB default install vs 80-171MB alternatives - 33x faster token chunking than popular alternatives - Supports multiple chunking strategies: token, word, sentence, and semantic - Works with all major tokenizers (transformers, tokenizers, tiktoken) - Zero external dependencies for basic functionality Technical optimizations: - Uses tiktoken with multi-threading for faster tokenization - Implements…
2024 · github.com · its alternatives →
11
I ported Tree-sitter to Go▲222
This started as a hard requirement for my TUI-based editor application, it ended up going in a few different directions. A suite of tools that help with semantic code entities: https://github.com/odvcencio/gts-suite A next-gen version control system called Got: https://github.com/odvcencio/got I think this has some pretty big potential! I think there's many classes of application (particularly legacy architecture) that can benefit from these kinds of analysis tooling. My next post will be about composing all these together, an exciting project I call…
Feb 2026 · github.com · its alternatives →
12
HelixDB – A graph database built on object storage▲159
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 →
13
Demystifying Advanced RAG Pipelines▲131
I've built an advanced RAG (Retrieval-Augmented Generation) pipeline from scratch to demystify the complex mechanics of modern LLM-powered Question Answering systems. This repository features: -- An implementation of a sub-question query engine from scratch to answer complex user questions. -- Illustrative explanations that unveil the inner workings of the system. -- An analysis of the challenges I faced while working with the system, like prompt engineering and cost estimation. -- Qualitative comparison with similar frameworks like LlamaIndex, offering a broader perspective. Key Takeaway:…
2023 · github.com · its alternatives →
14DE
Dump entire Git repos into a single file for LLM prompts▲57
Hey! I wanted to share a tool I've been working on. It's still very early and a work in progress, but I've found it incredibly helpful when working with Claude and OpenAI's models. What it does: I created a Python script that dumps your entire Git repository into a single file. This makes it much easier to use with Large Language Models (LLMs) and Retrieval-Augmented Generation (RAG) systems. Key Features: - Respects .gitignore patterns - Generates a tree-like directory structure - Includes file contents for all non-excluded files - Customizable file type filtering Why I find it useful for…
2024 · its alternatives →
15
RAG, No Vectors▲11
We built PageIndex, a document indexing system that turns documents into hierarchical search trees to support reasoning-based RAG. Traditional vector-based RAG often struggles with retrieval accuracy because it optimizes for similarity, not relevance. But what we really need in retrieval is relevance — which requires reasoning. When working with professional documents that demand domain expertise and multi-step reasoning, vector-based RAG and similarity search often fall short. So we started exploring a more reasoning-driven approach to RAG. Reasoning-based RAG enables LLMs to think and…
2025 · github.com · its alternatives →
16
CodeRLM – Tree-sitter-backed code indexing for LLM agents▲81
I've been building a tool that changes how LLM coding agents explore codebases, and I wanted to share it along with some early observations. Typically claude code globs directories, greps for patterns, and reads files with minimal guidance. It works in kind of the same way you'd learn to navigate a city by walking every street. You'll eventually build a mental map, but claude never does - at least not any that persists across different contexts. The Recursive Language Models paper from Zhang, Kraska, and Khattab at MIT CSAIL introduced a cleaner framing. Instead of cramming everything into…
Feb 2026 · github.com · its alternatives →
17
AI memory with biological decay (52% recall)▲98
Most RAG setups fail because they treat memory like a static filing cabinet. When every transient bug fix or abandoned rule is stored forever, the context window eventually chokes on noise, spiking token costs and degrading the agent's reasoning. This implementation experiments with a biological approach by using the Ebbinghaus forgetting curve to manage context as a living substrate. Memories are assigned a "strength" score where each recall reinforces the data and flattens its decay curve (spaced repetition), while unused data eventually hits a threshold and is pruned. To solve the…
Apr 2026 · github.com · its alternatives →
18
Open-source GraphRAG Application with your own data▲12
Hello. This is an easy-to-use application for exploring your own data with retrieval augmented generation (RAG) backed by txtai. txtai is an all-in-one embeddings database for semantic search, LLM orchestration and language model workflows. txtai has a feature to automatically create knowledge graphs using semantic similarity. This enables running Graph RAG queries with path traversals. This RAG application generates a visual network to illustrate the path traversals and help understand the context from which answers are generated from. Embeddings databases are used as the knowledge store.…
2024 · hub.docker.com · its alternatives →
19
LinkingMem - v0.3.0▲10
LinkingMem — Graph-native RAG Engine
Jul 2026 · linking-mem.vercel.app · its alternatives →
20AG
A GPU-accelerated binary vector index▲65
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
LazyGraphRAG: Setting a new standard for quality and cost▲6
This is a big update from the GraphRAG team! Significantly reduces the cost and speeds up indexing for GraphRAG all without much degradation in performance. Check it out!
2024 · microsoft.com · its alternatives →
22
A Simple GraphRAG Implementation▲30
I made a simple GraphRAG call nano-graphrag. The reason is I try to hack the official implementation released by Microsoft but that version is very hard to read/hack. This algorithm should not be implemented that annoying, I think. So I made a simpler one. It's about 800-900 lines of Python, and it's portable.
2024 · github.com · its alternatives →
23
Gistr▲55
Hey HN, We (a small team of engineers and a designer) have been building Gistr to solve a personal pain point: we consume a lot of content daily—articles, videos, podcasts—and often struggle to retain or revisit the most meaningful parts. Most bookmarking tools felt too passive or generic. So we made Gistr a tool that lets you save links and capture "gists" (notes, insights, highlights, AI summaries) on top of them. It supports YouTube, articles, PDFs, and more. You can keep things private or share your gists publicly, almost like AI-enhanced social bookmarks. We’re bootstrapped and still in…
May 2026 · gistr.so · its alternatives →
24
AutoRAG – AutoML tool for RAG. Find an optimal RAG pipeline▲18
- Discovering the most effective RAG pipeline for your specific data and use case can be daunting. It requires experimenting with various RAG modules and configurations, which are both time-consuming and complex. - AutoRAG addresses this challenge by automatically evaluating different combinations of RAG modules and their parameters. You don't need to write implementation code yourself; everything is set up through a single YAML file. - Our aim is to save you the hassle of continuously adapting to new RAG modules and configurations. Instead, you can focus on developing robust data for your…
2024 · 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 →