Knowledge Graph Based Persistent Memory Storage With Entity Relationship Modeling

via “entity-relationship graph persistence with json file backend”

Persistent knowledge graph memory storage for LLM conversations.

Unique: Official MCP reference implementation using TypeScript SDK with a deliberately simple JSON file backend (not a database) to demonstrate how MCP Tools can expose memory operations. The graph model separates entities (with properties), relations (typed edges), and observations (timestamped facts), allowing LLMs to reason about both structure and temporal context.

vs others: Simpler to deploy and understand than vector-database RAG systems because it uses explicit entity/relation storage instead of embeddings, making the knowledge graph directly inspectable and editable by humans or LLMs.

via “entity and relationship system for knowledge graph construction”

TypeScript framework for autonomous AI agents — multi-platform, plugins, memory, social agents.

Unique: Integrates entity and relationship tracking directly into agent memory system rather than as separate knowledge graph layer, enabling automatic knowledge graph construction from agent interactions. Entities and relationships are stored with embeddings for semantic queries.

vs others: More integrated than external knowledge graph systems (no separate service) but less sophisticated than dedicated graph databases; better for agent-centric knowledge tracking than general-purpose knowledge graphs.

via “hybrid vector-graph memory retrieval with semantic and structural search”

Persistent memory layer for AI agents.

Unique: Implements dual-index retrieval with automatic entity-relationship extraction and graph construction, using LLM-powered entity linking to merge semantically equivalent entities across memories. Reranking logic combines vector similarity scores with graph centrality metrics to produce hybrid relevance scores.

vs others: Outperforms pure vector search on structured queries (e.g., 'restaurants liked by users in tech industry') and pure graph search on semantic queries; hybrid approach reduces false negatives from both modalities.

via “graph-based entity and relationship extraction with configurable similarity thresholds”

Universal memory layer for AI Agents

Unique: Combines LLM-powered entity/relationship extraction with configurable similarity thresholds for entity deduplication, supporting multiple graph store backends (Neo4j, ArangoDB, etc.) via a factory pattern. Enables both semantic (embedding-based) and structural (graph traversal) queries on the same memory corpus.

vs others: More flexible than static knowledge graphs (pre-built DBpedia, Wikidata) because it dynamically extracts entities from conversational memories, and more practical than pure NLP pipelines (spaCy, Stanford CoreNLP) because it integrates extraction directly into the memory system with configurable LLM providers and automatic deduplication.

via “graph-based memory storage with semantic relationship indexing”

AI memory OS for LLM and Agent systems(moltbot,clawdbot,openclaw), enabling persistent Skill memory for cross-task skill reuse and evolution.

Unique: Uses property graphs with typed relationship edges (not just vector similarity) to encode semantic structure, enabling graph traversal queries and causal reasoning — unlike vector-only RAG systems (Pinecone, Weaviate), MemOS maintains explicit relationship semantics for structured memory navigation.

vs others: Supports relationship-aware queries and deduplication that vector databases cannot express, at the cost of higher operational complexity; better for agents needing causal chains, worse for pure similarity search at scale.

via “knowledge graph temporal entity-relationship tracking”

The best-benchmarked open-source AI memory system. And it's free.

Unique: Implements temporal knowledge graph in SQLite with explicit timestamp tracking for each triple, enabling time-series reasoning about fact evolution. Most knowledge graphs (Neo4j, ArangoDB) don't emphasize temporal queries; MemPalace treats time as a first-class dimension.

vs others: Simpler than external graph databases (no DevOps overhead) while supporting temporal reasoning that vector-only systems cannot express.

via “knowledge graph and graphrag support for structured reasoning”

Open-source LLM knowledge platform: turn raw documents into a queryable RAG, an autonomous reasoning agent, and a self-maintaining Wiki.

Unique: Integrates knowledge graph construction as an optional enhancement to RAG, allowing queries to traverse entity relationships for multi-hop reasoning. Graph construction is async and does not block document indexing.

vs others: More structured than flat document retrieval (relationships are explicit), more scalable than manual knowledge curation (automatic extraction), and more interpretable than pure semantic search (reasoning paths are visible).

via “typed-knowledge-graph-storage-and-querying”

Open-source persistent memory for AI agent pipelines (LangGraph, CrewAI, AutoGen) and Claude. REST API + knowledge graph + autonomous consolidation.

Unique: Implements a typed knowledge graph within a relational database (SQLite/D1) rather than a dedicated graph database, enabling lightweight deployment without external infrastructure. Supports autonomous relationship inference based on semantic similarity and metadata, allowing agents to discover indirect connections without explicit programming.

vs others: Simpler to deploy than Neo4j or ArangoDB because it uses standard SQL; more semantically rich than flat vector stores because relationships carry type information that enables domain-aware reasoning.

via “graph-based persistent memory storage with uri-hierarchical addressing”

A lightweight, rollbackable, and visual Long-Term Memory Server for MCP Agents. Say goodbye to Vector RAG and amnesia. Empower your AI with persistent, graph-like structured memory across any model, session, or tool. Drop-in replacement for OpenClaw.

Unique: Uses URI-based hierarchical addressing (domain://path) with a four-layer graph model (Node-Memory-Edge-Path) instead of vector embeddings, preserving structural relationships and enabling deterministic path-based queries. This is fundamentally different from Vector RAG which fragments knowledge into embedding vectors and loses hierarchy.

vs others: Preserves memory structure and relationships unlike Vector RAG which causes 'semantic shredding'; enables deterministic URI-based retrieval instead of probabilistic cosine similarity matching, making memory queries reliable and debuggable.

via “knowledge graph generation from unstructured text via llm-driven entity and relationship extraction”

The memory for your AI Agents in 6 lines of code

Unique: Implements a dual-storage architecture where extracted triplets are simultaneously indexed in both graph and vector databases (cognee/infrastructure/databases/), enabling hybrid queries that combine structural graph traversal with semantic vector similarity. Supports custom graph models via Pydantic schemas, allowing developers to define domain-specific entity types and relationship types without modifying core extraction logic.

vs others: Outperforms single-database RAG systems (like Pinecone-only or Neo4j-only) because it preserves both structural relationships (for reasoning) and semantic similarity (for relevance), reducing hallucination through multi-path validation; more flexible than LlamaIndex's graph RAG because custom schemas are first-class citizens.

via “graph network construction and traversal for knowledge representation”

💡 All-in-one AI framework for semantic search, LLM orchestration and language model workflows

Unique: Graph networks are co-indexed with vector embeddings in the same storage backend, enabling atomic graph + vector queries without separate graph database; supports relationship-aware retrieval where graph traversal results are automatically merged with semantic search results

vs others: Simpler than Neo4j + vector DB because graph and vector search are unified in one index, but less feature-rich for complex graph algorithms; better for RAG use cases where you want relationship-aware retrieval without operational complexity of dual systems

via “knowledge graph construction and traversal”

Project-local RAG memory MCP server — knowledge graph + multilingual vector + FTS5 in a single SQLite file. Per-project isolation, 30 MCP tools, codepoint-safe chunking (Korean/CJK/emoji).

Unique: Integrates knowledge graph construction directly into MCP server, allowing LLM agents to reason over structured entity relationships alongside vector similarity, rather than treating the knowledge base as unstructured text chunks

vs others: More structured than pure vector RAG for complex domains, and more accessible than standalone graph databases because it's embedded in the MCP workflow without requiring separate infrastructure

via “persistent knowledge graph memory for ai agents with semantic search”

Neo4j Labs Model Context Protocol servers

Unique: Implements memory as a graph structure rather than flat vector embeddings, allowing agents to reason over relationship patterns and entity connections. Uses Neo4j's native graph query capabilities to retrieve contextual subgraphs relevant to current agent state, combining pattern matching with semantic search for multi-dimensional retrieval.

vs others: Outperforms vector-only memory systems for relationship-heavy reasoning because it preserves and queries structural relationships between facts, enabling agents to discover indirect connections and reason over graph patterns that vector similarity alone cannot capture.

via “knowledge-graph construction and relationship inference”

Send voice notes to Telegram → get organized knowledge base, tasks in Todoist, and daily reports. Persistent memory with Ebbinghaus decay, vault health scoring, knowledge graph. Runs on Claude Code + OpenClaw. 5/mo.

Unique: Uses Claude for semantic relationship inference rather than keyword matching or NLP libraries, enabling understanding of implicit connections (e.g., 'this contradicts what I said about X'). Integrates graph structure into vault health scoring.

vs others: More semantically accurate than Obsidian's backlink system because it infers relationships from content meaning, not just explicit links; more scalable than manual tagging because inference is automated.

via “entity-centric knowledge graph construction with temporal versioning”

Memento MCP: A Knowledge Graph Memory System for LLMs

Unique: Implements complete temporal versioning at the entity level with automatic confidence decay calculations, rather than treating the knowledge graph as a static snapshot. Uses Neo4j's native graph structure combined with timestamp-aware queries to enable point-in-time reconstruction without separate time-series databases.

vs others: Provides temporal awareness and confidence decay that vector-only memory systems (like simple RAG) lack, while maintaining graph structure advantages over flat document stores for relationship reasoning.

via “graph storage and persistence with sqlite backend”

Local knowledge graph for Claude Code. Builds a persistent map of your codebase so Claude reads only what matters — 6.8× fewer tokens on reviews and up to 49× on daily coding tasks.

Unique: Uses SQLite as a lightweight, zero-configuration graph storage backend with indexes optimized for common query patterns (entity lookup, relationship traversal, impact analysis). The storage layer supports concurrent read access and requires no external services.

vs others: Simpler than cloud-based graph databases (Neo4j, ArangoDB) because it requires no external services or configuration, making it suitable for local development and CI/CD pipelines.

via “memory and knowledge graph server with structured storage”

OpenAPI Tool Servers

Unique: Implements a graph-based memory model specifically designed for LLM agents, allowing storage of entities and relationships with semantic meaning, enabling agents to reason about connections between stored information rather than treating memory as isolated key-value pairs

vs others: Unlike simple key-value memory systems, the knowledge graph server enables semantic reasoning by storing and querying relationships between entities, allowing agents to discover related information through graph traversal rather than explicit keyword matching

via “persistent memory storage”

Store and retrieve user-specific memories across sessions using Neo4j graph database. This MCP memory infrastructure enables AI assistants to maintain context, recall past interactions, and manage memories with semantic search capabilities. Transform your agent's conversations into a searchable memo

Unique: Utilizes Neo4j's graph structure to create a highly interconnected memory system, allowing for complex relationships between memories.

vs others: More efficient in managing relationships between memories compared to traditional key-value stores.

via “persistent agent memory with knowledge graph integration”

44 plug-and-play skills for OpenClaw — self-modifying AI agent with cron scheduling, security guardrails, persistent memory, knowledge graphs, and MCP health monitoring. Your agent teaches itself new behaviors during conversation.

Unique: Combines three memory types (conversation buffer, episodic, semantic) with explicit knowledge graph representation, enabling agents to not just recall facts but reason over structured relationships — most agent frameworks only implement flat conversation history

vs others: Richer than LangChain's ConversationBufferMemory because it extracts and structures knowledge as a graph, enabling complex reasoning patterns like 'find all users who interacted with this service' rather than just keyword search

via “structured knowledge graph storage”

Store and recall user-specific facts across conversations with a structured knowledge graph. Add, relate, and search information about people, organizations, events, and preferences to maintain consistent context. Automatically extract locations and build place hierarchies for richer, more accurate

Unique: Employs a graph-based approach for context storage, allowing for dynamic relationships and efficient querying, unlike traditional relational databases.

vs others: More flexible in managing complex relationships than standard key-value stores, enabling richer context recall.