Project Atlas · Technical Landscape

GraphRAG feature & pricing matrix

A README-based comparison of eight shortlisted open-source graph knowledge systems, complemented by Stripe and Cerebras production reference architectures.

Snapshot: 11 August 2026 8 OSS approaches + 2 references MIT / Apache-style OSS Prices in USD

Matrix 01

What each project is actually for

Projects that share the “GraphRAG” label solve substantially different problems. This is the most important matrix in the report.

Shortlist positioning, best fit and boundary
ShortlistDesigned to doBest fitNot primarily
nano-graphragSmall implementation of Microsoft-style GraphRAGLearning, source study and controlled experimentsA complete multi-tenant production platform
Microsoft GraphRAGBatch extraction, graph communities and hierarchical reports over documentsWhole-corpus themes plus entity-focused questionsA supported managed product or native graph database
LightRAGLighter graph/vector RAG server with several retrieval modes and storage adaptersGeneral self-hosted GraphRAG, incremental documents and multimodal filesA formal ontology or symbolic-rule engine
HippoRAGLong-term memory retrieval using a KG and Personalized PageRankAssociative, multi-hop and continual-learning researchA turnkey enterprise knowledge platform
GraphitiBi-temporal context graph that evolves episode by episodeAgent memory, changing facts and historical questionsStatic whole-corpus community summarization
KAG + OpenSPGSchema-constrained domain knowledge plus logical-form-guided reasoningProfessional domains with rules, terminology and factual multi-hop questionsA minimal plug-and-play RAG library
Neo4j GraphRAG + Graph BuilderPractical KG construction and multiple retrieval patterns on Neo4jProperty-graph applications, Cypher and managed graph infrastructureDatabase-neutral GraphRAG
TrustGraphFull context-engineering and agent backend using ontology, graph/vector retrieval and provenanceSovereign, explainable, multi-tenant context infrastructureA small embeddable library

Matrix 02

Capability comparison

explicit core capability limited, indirect or secondary not explicit in reviewed README
Capabilities explicitly described by current project documentation
CapabilitynanoMicrosoftLightRAGHippoRAGGraphitiKAG / OpenSPGNeo4jTrustGraph
Automatic entity/relation extraction
Formal schema/ontology
Vector + graph retrieval
Lexical/keyword retrieval✓ BM25✓ exact/text✓ full-text
Whole-corpus global summary✓ top communities✓ map-reduce reports✓ global/mix◐ global-vector
Incremental ingestion✓ report rebuild◐ batch-biased✓ continual✓ real-time episodes✓ iterative◐ pipeline-driven✓ flows
Selective deletion/retraction✓ affected-KG rebuild✓ temporal invalidation◐ app logic◐ version/flow
Explicit temporal validity/history✓ bi-temporal◐ freshness/version
Symbolic rules/logical reasoning✓ KGDSL/reasoner◐ Cypher traversal◐ ontology policy
Multi-hop/associative retrieval◐ DRIFT/local◐ relationship chains✓ PPR✓ graph search✓ graph/Cypher✓ traceable paths
Multimodal document reasoning✓ VLM + parsers◐ processing◐ varied sources◐ media stack
Built-in web UI— core✓ Graph Builder
REST API / MCPLibraryCLI/Python✓ RESTLibrary✓ REST/MCPSDK/serverPython + app API✓ API/MCP
Built-in multi-tenancy/isolation◐ workspaces/auth◐ groups◐ project/domainApp/database dependent✓ workspace/collection/flow

Whole-corpus specialist

Microsoft global search uses community reports in a map-reduce query. It is distinctive—and resource intensive.

Temporal specialist

Graphiti uniquely models fact-validity windows and preserves superseded facts as history.

Semantic-control specialist

KAG/OpenSPG provides the strongest schema, normalization and rule model, with the highest up-front modeling work.

Full-stack specialist

TrustGraph supplies orchestration, storage, ingestion, retrieval, MCP and UI—along with the largest operations surface.

Matrix 03

Architecture, storage and deployment

Storage, model integration, deployment shape and principal operational concern
ShortlistStorageModel choicesDeploymentMain operational concern
nanoDisk KV, nano-vectordb, NetworkX; Neo4j/HNSW/Milvus/FAISS optionsOpenAI, Bedrock; examples for Ollama, DeepSeek and sentence-transformersPython package, single host by defaultIncremental inserts avoid duplicate chunks but recompute communities and reports
MicrosoftParquet tables plus configured vector store; no graph DB requiredConfigurable model providers and LiteLLMCLI or Python index/query pipelinesMany standard-index LLM passes; version/config changes can require migration or re-indexing
LightRAGKV, vector, graph and document-status roles; unified or specialized production backendsSeparate extraction, query, keyword and VLM roles; hosted or local providersREST server/Web UI via Docker, or Python coreStorage tuning; embedding-dimension changes require vector-state rebuilding
HippoRAGLocal output/index artifacts in packaged workflowOpenAI-compatible, Bedrock and local vLLMPython research/library workflowGPU/model capacity and independent validation of research results
GraphitiNeo4j, FalkorDB or Neptune; Neptune also uses OpenSearch ServerlessOpenAI default; Anthropic, Gemini, Groq and compatible/local serversPython core, FastAPI and MCPStructured-output reliability, graph operations and ongoing extraction/deduplication
KAG/OpenSPGOpenSPG engine with pluggable graph and algorithm servicesLLMs plus NLP/deep-learning operatorsEngine, builder, reasoner, SDK/server and domain solutionSchema governance, entity alignment, custom operators and integration complexity
Neo4jNeo4j 5.x + APOC; vectors in Neo4j or external Weaviate/Pinecone/QdrantOllama, OpenAI/Azure, Google, Cohere, Anthropic, Mistral and BedrockPython package, Graph Builder UI/backend, self-managed or AuraNeo4j capacity and production caution around experimental KG-builder APIs
TrustGraphCassandra, Qdrant, Garage object storage and Pulsar or RabbitMQHosted providers or local vLLM, Ollama, TGI, LM Studio and LlamafilesMulti-container Docker/Podman or KubernetesLargest platform-operations footprint, though fewer mandatory external services

Matrix 04

Production reference architectures

Stripe and Cerebras demonstrate production patterns, but neither publishes a reusable end-to-end knowledge-base implementation. They are references, not additional open-source shortlist candidates.

Stripe and Cerebras compared as production reference architectures
ReferenceScope and interfaceRetrieval and storageGraph / Tree-sitterSecurityOpenness and priceAtlas lesson
Stripe AI knowledge base Hosted MCP for searching Stripe documentation and support material, alongside narrowly scoped API discovery, planning, read and write tools Backend retrieval, ranking and storage are not publicly disclosed No public evidence of a knowledge graph or Tree-sitter OAuth or restricted API keys, account scope, constrained tools and confirmation for consequential actions Client and agent tooling is MIT; hosted KB backend is proprietary. No separate public KB/MCP list price found. Expose knowledge and actions as safe, task-oriented tools—not storage or a generally privileged agent
Cerebras Knowledge Internal enterprise knowledge across Slack, code, documents and operational systems, delivered through web, automation and simple MCP retrieval primitives PostgreSQL text, embeddings and metadata; full-text/vector retrieval with source signals, freshness, rank fusion, reranking and context restoration Not GraphRAG. Cerebras names CocoIndex; current CocoIndex code indexing uses Tree-sitter, making this an indirect connection rather than proof of Cerebras's exact deployed splitter version. Authentication, authorization, auditing, analytics and project/source scoping; exact row-level ACL mechanics are not public Internal system with no public price; individual infrastructure components are independently available Build an ACL-aware hybrid baseline first; add graphs only for measured multi-hop, temporal or ontology gains

Stripe: control-plane reference

Narrow MCP tools, scoped credentials and human confirmation establish a strong boundary around knowledge and actions.

Cerebras: retrieval reference

Incremental ingestion, source-specific processing, hybrid ranking and evidence packaging create a strong non-graph baseline.

Tree-sitter's role

Tree-sitter preserves code structure before embedding or graph extraction; it is an ingestion technique, not a graph engine.

Matrix 05

Pricing and cost tendency

Relative cost is an architectural judgment, not an equal-corpus price benchmark. A fair comparison fixes corpus, model quality, schema, update rate, query mix, latency SLO and evaluation target.

Repository cost, managed options, public list price and self-hosted cost drivers
ShortlistRepositoryManaged optionPublic list priceSelf-hosted cost driversCost tendency
nanoMIT · $0None publishedNot applicableExtraction/summary models, embeddings, optional graph/vector DBLow lab infrastructure; medium–high indexing tokens
MicrosoftMIT · $0Repository is not an officially supported offeringNo GraphRAG product priceLLM extraction and summaries, community reports, query model, embeddings, vector storageHigh standard indexing/global search; FastGraphRAG is cheaper
LightRAGMIT · $0None publishedNot applicableFour storage roles, four model roles, embeddings, reranker and parsersMedium with local models; rises with multimodal/production backends
HippoRAGMIT · $0None publishedNot applicableLLM/embedding APIs or GPU-hosted vLLM, index storageLow–medium offline per README; verify independently
GraphitiApache-2.0 · $0 self-hostedZepFree: 10k credits/month. Flex: $125/month or $1,250/year. Flex Plus: $375/month or $3,750/year. Enterprise: negotiated.Models, embeddings/reranker, graph DB and continuous episode processingMedium–high self-hosted; managed scales with episode bytes
KAG/OpenSPGApache-2.0 · $0No public managed price foundNot publishedGraph engine, compute, LLMs, NLP operators, modeling team and operationsHigh engineering/fixed cost
Neo4jGraphRAG/Builder · $0AuraDBFree: $0. Professional: $65/GB/month; 1 GB example $65.70/month. Business Critical: $146/GB/month, 2 GB minimum; 2 GB example $292/month.Database capacity, extraction/generation, embeddings, app compute, optional vector DBLow prototype cost; predictable DB + variable models
TrustGraphApache-2.0 · $0Optional support; no fixed public support priceVendor illustration for 1M docs/10M queries: $5k–$9k/month ($3k–$5k infrastructure + $2k–$4k LLM). Not a quote.Multi-container storage/messaging, compute/GPU, models, OCR and operationsHigh fixed platform cost; improves economically at scale

Why Microsoft-style indexing is usually expensive

Standard GraphRAG uses models for entity and relationship extraction, entity and relationship summaries, optional claims and community reports. FastGraphRAG replaces much extraction with NLP while retaining model-generated community reports. Microsoft estimates graph extraction at roughly 75% of standard indexing cost.

monthly total = ingestion model calls
              + embedding and reranking calls
              + query-generation calls
              + graph, vector and object storage
              + compute or GPU
              + observability, backups and network
              + engineering and on-call operations

Matrix 06

Select by requirement, not popularity

First and second project to evaluate for each architectural priority
PriorityEvaluate firstCompare against
Learn internalsnanoMicrosoft GraphRAG
Whole-corpus themesMicrosoft GraphRAGLightRAG global/mix
General self-hosted document GraphRAGLightRAGNeo4j ecosystem
Multi-hop retrieval researchHippoRAGKAG
Changing agent memoryGraphitiTrustGraph
Formal ontology and deterministic rulesKAG/OpenSPGTrustGraph
Managed property graphNeo4j/AuraGraphiti/Zep for agent memory
Sovereign full context platformTrustGraphLightRAG + selected infrastructure
Lowest-cost learning prototypenano + local modelsGraph Builder + AuraDB Free

Decision method

Recommended four-hypothesis proof of concept

  1. Baseline: lexical + vector RAG without a graph.
  2. Document GraphRAG: LightRAG and Microsoft on whole-corpus and entity questions.
  3. Temporal memory: Graphiti on corrections, superseded facts and historical questions.
  4. Controlled domain graph: Neo4j or KAG/OpenSPG on schema-constrained multi-hop questions.

Hold the generator model constant where possible. Measure retrieval precision/recall, multi-hop accuracy, faithfulness, provenance correctness, ACL leakage, indexing and query cost, update/deletion latency, P50/P95 latency, failure rate and engineer-days to production.

Evidence

Official sources reviewed