claude-memory-search-mcp
Related Servers
Alternatives to claude-memory-search-mcp
No user-submitted related servers found.
Related Servers
- AlicenseNot gradedqualityCmaintenanceEnables searching and retrieving Claude Code conversation history via hybrid semantic and keyword search, allowing the agent to access its own past interactions.4MIT
- AlicenseNot gradedqualityCmaintenanceProvides local-first, cross-session memory for Claude Code, enabling semantic search across past sessions to retrieve procedures, decisions, or answers without exposing secrets.Apache 2.0
- AlicenseNot gradedqualityDmaintenanceProvides persistent memory for Claude Code, automatically extracting and surfacing relevant context from past sessions to avoid re-explaining issues and decisions.MIT
- AlicenseAqualityDmaintenanceEnables efficient code navigation and retrieval through natural language search, BM25 ranking, and fuzzy matching across multiple programming languages. It drastically reduces token usage by allowing Claude to query specific code symbols and logic instead of reading entire files.1370 npm13MIT
- AlicenseBqualityDmaintenanceProvides a durable memory layer for coding agents like Claude Code and Codex by indexing codebases and enabling RAG queries, reducing rediscovery tokens and providing senior-engineer orientation.23MIT
- AlicenseNot gradedqualityCmaintenanceGives Claude Code long-term memory that persists across sessions via hybrid BM25 and vector semantic search, with multi-project isolation.4 npm8MIT
TDQS
Scored across 4 tools
Each tool has a clearly distinct purpose: find_related for wikilink navigation, get_memory for full content retrieval, list_memories for enumeration with filtering, and search_memory for keyword search. No overlap in functionality.
All tool names follow the consistent snake_case verb_noun pattern (find_related, get_memory, list_memories, search_memory). No deviations or mixed conventions.
4 tools is well-scoped for a memory search server. Each tool serves a distinct need (listing, retrieval, search, link navigation) without unnecessary redundancy or gaps.
The set covers core read/search operations for a memory system. However, it lacks write operations (create, update, delete), which may be intentional given the 'search' focus, but slightly limits completeness for full lifecycle management.