memory-mcp
Server Configuration
Describes the environment variables required to run the server.
| Name | Required | Description | Default |
|---|---|---|---|
| MEMORY_DB_PATH | No | Path to the SQLite database file (default: ~/.vibe/memory.db) | ~/.vibe/memory.db |
| MEMORY_FILE_PATH | No | Path to the JSONL file for backward compatibility (default: ~/.vibe/memory.jsonl) | ~/.vibe/memory.jsonl |
Instructions
Guidance the server publishes about itself, which clients place ahead of the tool catalog so the model reads it before choosing anything.
This server publishes no instructions, or was last inspected before Glama recorded them.
Capabilities
Features and capabilities supported by this server
Protocol revision2025-11-25
| Capability | Details |
|---|---|
| tools | {
"listChanged": false
} |
| prompts | {
"listChanged": false
} |
| resources | {
"subscribe": false,
"listChanged": false
} |
| experimental | {} |
Tools
Functions exposed to the LLM to take actions
| Name | Description |
|---|---|
| create_entitiesA | Create multiple new entities in the knowledge graph. Each entity must have: name (str), entityType (str), observations (list[str]). |
| create_relationsA | Create multiple new relations between entities in the knowledge graph. Each relation must have: from (str), to (str), relationType (str). |
| add_observationsA | Add new observations to existing entities in the knowledge graph. Each item must have: entityName (str), contents (list[str]). |
| delete_entitiesA | Delete multiple entities and their associated relations from the knowledge graph. |
| delete_observationsA | Delete specific observations from entities in the knowledge graph. Each item must have: entityName (str), observations (list[str] — exact content match). |
| delete_relationsA | Delete multiple relations from the knowledge graph. Each relation must have: from (str), to (str), relationType (str). If relationType is omitted, all relations between from and to are deleted. |
| search_nodesA | Search for nodes in the knowledge graph. Case-insensitive token match across entity names, types, and observation content. Returns matching entities with their observations. |
| open_nodesB | Open specific nodes in the knowledge graph by their names. Returns full entity details including all observations and timestamps. |
| read_graphA | Read the entire knowledge graph. Returns all entities with observations and all relations. Note: loads the full graph into memory — may be large. |
| traverseA | Traverse the graph from a starting node, returning all entities within N hops. Args: start_node: Entity name to start from depth: Number of hops to traverse (default 1, max 3) |
| recentA | Return entities, relations, and observations created or updated in the last N hours. Args: hours: Look-back window in hours (default 24, max 720) |
| search_similarA | Fuzzy search for entity names using trigram similarity. Args: name: Name to search for (fuzzy matched) threshold: Minimum similarity score 0.0–1.0 (default 0.3) |
Prompts
Interactive templates invoked by user choice
| Name | Description |
|---|---|
No prompts | |
Resources
Contextual data attached and managed by the client
| Name | Description |
|---|---|
No resources | |
TDQS
Scored across 12 tools
Each tool targets a distinct operation: create/delete entities, add/delete observations, create/delete relations, search via token match vs fuzzy name match, open specific nodes vs read full graph vs traverse vs recent. The descriptions clearly differentiate similar-sounding tools like search_nodes and search_similar.
The naming predominantly follows a verb_noun snake_case pattern (create_entities, delete_relations, search_nodes). Minor deviations exist with 'recent' and 'traverse' which are single-word verbs, but they are still descriptive and do not disrupt overall consistency.
With 12 tools, the server is well-scoped for a knowledge graph memory system. Each tool serves a clear purpose, and the count is within the ideal range for a domain-specific MCP server.
The tool set provides comprehensive coverage for managing a knowledge graph: create/delete entities, add/delete observations, create/delete relations, multiple retrieval methods (specific, full graph, traversal, recent, search), and fuzzy search. Update operations are supported via add/delete observations and create/delete relations, covering the full lifecycle without dead ends.