Skip to content
Skills Library
AI & agents · Research

memory-query-workflow

/memory-query-workflow

Use when a graph already exists and the user needs retrieval, tracing, explanation, or gap detection from graph memory before reopening the full corpus.

Licence
Apache-2.0
Last repository change
27.09.2026

Assessment and security

100/ 100Class: good
Format25 / 25
Frontmatter with name and description, valid name, description up to 1,024 characters, name matching the folder.
Discoverability25 / 25
Description explains when to use the skill, has a reasonable length and uses third person.
Content35 / 35
At least 150 words and at most 500 lines, headings, step lists, examples or code.
Hygiene15 / 15
No placeholders such as TODO, no Windows paths, with a licence.
Riskno signals detected in the scan
Files in this package
1
Scripts
0
HTML comments
0
URLs in SKILL.md
0
Deprecation

No signals detected. Repository changed on 27.09.2026, without references to retired models or APIs.

Licence

Apache-2.0, otwarta: można używać i zmieniać, z zachowaniem licencji i informacji o zmianach.

What it does and when to use it

Use when a graph already exists and the user needs retrieval, tracing, explanation, or gap detection from graph memory before reopening the full corpus.

Original author description

Use when a graph already exists and the user needs retrieval, tracing, explanation, or gap detection from graph memory before reopening the full corpus.

How it works

  1. Overview
  2. Required Check
  3. Required State
  4. Routing
  5. Core Rules
  6. Minimal Workflow
  7. Common Failure Modes
  8. Verification
  9. Reference
Original SKILL.md headings · 63 lines, 339 words
SKILL.md preview
---
name: memory-query-workflow
description: Use when a graph already exists and the user needs retrieval, tracing, explanation, or gap detection from graph memory before reopening the full corpus.
---

# Memory Query Workflow

## Overview

Use existing graph memory first.

Query the graph before rereading source files unless the graph is missing, stale, or too weak for the question.

## Required Check

```powershell
apx check graphify
```

## Required State

- existing `graphify-out/graph.json`

## Routing

| Question shape | Action |
|---|---|
| broad question about connected concepts | `graphify query` |
| trace between two concepts, files, or systems | `graphify path` |
| explain one concept or node in context | `graphify explain` |
| no graph exists | switch to `memory-build-workflow` |
| graph exists but corpus changed | recommend `graphify --update` before trusting results |

## Core Rules

- prefer graph retrieval over full-corpus reread
- say explicitly when the graph is missing, stale, sparse, or weakly matched
- do not overclaim beyond what graph nodes and edges support
- when graph coverage is weak, use the graph result to target the next direct read instead of restarting broad exploration

## Minimal Workflow

1. Confirm `graphify-out/graph.json` exists.
2. Choose `query`, `path`, or `explain` based on question shape.
3. Answer from graph evidence first.
4. If result quality is weak, say why: missing graph, stale graph, low coverage, or weak node match.
5. Escalate to build/update or targeted reread only when needed.

## Common Failure Modes

- skipping graph lookup and rereading everything
- hiding that the graph is stale or incomplete
- using `query` for a question that clearly needs a path trace
- treating no-result output as proof the corpus lacks the concept

## Verification

- [ ] Graph existence was confirmed before any query ran
- [ ] The command matched the question shape: query for breadth, path for traces, explain for one node
- [ ] The answer is grounded in graph nodes and edges — no overclaiming
- [ ] Staleness, sparseness, or weak node matches were stated explicitly
- [ ] Escalation to build, update, or targeted reread happened only when graph evidence was insufficient

## Reference

- [`../graphify/UPSTREAM.md`](../graphify/UPSTREAM.md)

Versions

The database has no other skills named memory-query-workflow.

Identical content appears in 1 other GitHub folders. We show one copy with the highest score.

Database snapshot: 13.11.2026 · package version 9026a9e53a7d (SHA-256 digest of the entire package)

Downloads in the last 30 days: 0 · ranking

Report a problem with this skill: harmful content, incorrect descriptions or an author’s removal request.

Similar skills

  • 100memory-cli
    Use when the user needs to run hoangsa-memory CLI commands — init / index / query / watch / memory / archive / impact / context / changes / graph / projects. Examples: "index this repo", "show memory", "trace the graph", "find taint paths", "consolidate memory".
  • 100memory-optimization-workflow
    Use when deciding the lowest-cost context path for a mixed corpus, especially when choosing among direct reading, helper conversion, graph build, graph update, or graph query.
  • 100claude-memory-graph
    Visualize Claude Code's memories as an interactive graph. Builds one self-contained HTML file from every memory in ~/.claude/projects/*/memory, grouped by workspace, with [[links]] as edges, search, type filters and a detail panel. Use when the user asks to see, visualize, map…
  • 100memory
    Use when user invokes /memory with a subcommand (search, trace, add, episode, status). Also triggers on "search my memory for X", "add to memory", "what do I know about X" (when membrain is available), "memory status", "memory trace". Searches and manages the membrain knowledge…
  • 100cognee
    Use when the user says 'cognee', asks about knowledge graph or graph memory, wants to switch memory backends, or needs a status check, dataset init, or graph view. Covers Cognee endpoints plus the Brain fallback.
  • 100agent-memory
    Give an agent persistent semantic memory with @three-ws/agent-memory. Use when code needs to remember facts across sessions, recall them by meaning, read the entity graph, or curate an agent's working context.

Feedback and reports

Your message goes to Bartosz Sokoliński. An email address is needed only for a reply. See the privacy policy.