memory-fabric

Orchestrate knowledge graph memory operations with entity extraction and deduplication.

217|20|Updated Dec 31, 2025
One-click install
npx skills add https://github.com/yonatangross/orchestkit --skill memory-fabric
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: memory-fabric
Source: https://github.com/yonatangross/orchestkit/tree/main/plugins/ork/skills/memory-fabric
Command: npx skills add https://github.com/yonatangross/orchestkit --skill memory-fabric

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) and references (resource) and rules (resource) components.

What problem does it solve?

This Skill streamlines the process of managing and retrieving information from a knowledge graph, ensuring that relevant memories are accurately extracted, deduplicated, and cross-referenced for enhanced context.

Core Features & Use Cases

  • Intelligent Entity Extraction: Automatically identifies and extracts key entities and relationships from natural language inputs.
  • Unified Search & Deduplication: Queries the knowledge graph, normalizes results, and removes redundant information based on similarity.
  • Cross-Reference Boosting: Enhances the relevance of memories by linking them to other related entities within the graph.
  • Use Case: When designing a new system, ask "What pagination approach did database-engineer recommend?" and get a consolidated, ranked answer with all relevant context, even if the information was stored in different parts of the graph.

Quick Start

Use the memory-fabric skill to parse the query "What pagination approach did database-engineer recommend?" and retrieve unified search results from the knowledge graph.

Frequently Asked Questions about memory-fabric

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I deduplicate and unify knowledge graph memory search results for complex queries?

To unify knowledge graph memory search results, query the graph, normalize the retrieved information, and remove redundant entries based on similarity. This deduplication ensures consolidated, ranked answers with comprehensive context for complex queries.

How does cross-reference boosting work in a knowledge graph memory system?

Cross-reference boosting enhances memory relevance by linking extracted entities to other related entities within the graph database. It boosts the ranking of interconnected memories, ensuring unified context retrieval for complex natural language queries.

How to extract entities and relationships from natural language inputs for a graph database?

Extract entities and relationships from natural language inputs by parsing user queries and interacting with a memory server. This process automatically identifies key entities to orchestrate knowledge graph memory operations accurately.

What is the best way to handle graph consistency and staleness in knowledge graph memory orchestration?

Handling graph consistency and staleness in knowledge graph memory requires orchestration tools that manage graph interactions and ensure context remains current. This prevents outdated information from degrading unified search and cross-reference boosting.

Do I need an MCP memory server to orchestrate knowledge graph memory operations?

Yes, orchestrating knowledge graph memory operations requires an MCP memory server. The system leverages these specific server tools for graph interaction, ensuring accurate entity extraction, query parsing, and unified context retrieval.

Why does my knowledge graph return redundant information when querying related entities?

Knowledge graphs return redundant information when memories are stored in different parts of the graph without deduplication. Applying similarity-based normalization and deduplication during retrieval resolves this and consolidates ranked answers.