Claude Memory MCP Server
Related Servers
Alternatives to Claude Memory MCP Server
No user-submitted related servers found.
Related Servers
AlicenseAqualityAmaintenanceEnables persistent long-term memory for Claude Code across sessions, with tools for storing, searching, and managing facts, knowledge graphs, and procedural lessons.355Apache 2.0- FlicenseNot gradedqualityDmaintenanceProvides persistent memory capabilities for Claude Code using Neo4j graph database to track development tasks, code patterns, solutions, and their relationships across sessions and projects, enabling contextual assistance and pattern recognition.11-
- AlicenseNot gradedqualityDmaintenanceProvides persistent cross-session memory for Claude Code, enabling it to remember user preferences, decisions, and project context across new sessions.Apache 2.0
- AlicenseNot gradedqualityCmaintenanceEnables Claude Code with persistent memory that learns from past sessions, capturing coding episodes and surfacing relevant memories to improve over time.6Apache 2.0
- AlicenseNot gradedqualityDmaintenanceProvides persistent memory for Claude by implementing a local knowledge graph to store and retrieve entities, relations, and observations. This enables long-term information retention and personalization across different chat sessions.163,576 npm-
- AlicenseNot gradedqualityAmaintenanceEnables Claude Code and other LLM agents to capture, consolidate, and retrieve memories from conversation history, building a local-first knowledge graph with semantic search and dream-state consolidation.393 npm1MIT
TDQS
Scored across 11 tools
Tools are largely distinct with clear separation between knowledge graph concepts and observations. However, memory_get_knowledge_index and memory_get_index could be confused, and memory_find_solutions vs memory_find_related serve similar traversal purposes.
All tools follow a consistent memory_ verb_noun pattern (get, find, add, search). The structure is uniform and predictable across both concepts and observations.
11 tools is well within the ideal range and covers the two main domains (knowledge graph and observations) without excessive overlap or redundancy.
Core operations for adding and retrieving concepts, observations, and connections are covered, plus search and index views. Missing update/delete operations, but memory systems often favor append-only, and the lack is a minor gap.