This optimized memory MCP server, developed by Herman Wong, provides a persistent knowledge graph for AI systems using SQLite as a backend. Built with Python and leveraging libraries like aiofiles and mcp, it offers tools for creating, updating, and querying entities, relations, and observations in a graph structure. The server is designed for efficient memory management and seamless integration with Claude Desktop. By abstracting knowledge storage and retrieval into a standardized MCP interface, it enables AI assistants to maintain context and personalize interactions across conversations. This implementation is particularly useful for applications requiring long-term memory and relationship modeling, such as personalized chat systems, knowledge management tools, or AI-powered personal assistants.
Aucun avis encore. Soyez le premier à donner votre avis !
Connectez-vous pour rejoindre la conversation
Highlight AICreate multiple new entities in the knowledge graph. Input: entities (array of objects) containing name (string), entityType (string), and observations (string[]).
Create multiple new relations between entities. Input: relations (array of objects) containing from (string), to (string), and relationType (string).
Add new observations to existing entities. Input: observations (array of objects) containing entityName (string) and contents (string[]).
Remove entities and their relations. Input: entityNames (string[]).
Remove specific observations from entities. Input: deletions (array of objects) containing entityName (string) and observations (string[]).
Remove specific relations from the graph. Input: relations (array of objects) containing from (string), to (string), and relationType (string).
Read the entire knowledge graph. No input required. Returns complete graph structure with all entities and relations.
Search for nodes based on query. Input: query (string). Returns matching entities and their relations.
Retrieve specific nodes by name. Input: names (string[]). Returns requested entities and relations between them.
