Skip to content

Latest commit

Β 

History

History
50 lines (34 loc) Β· 1.4 KB

relationship-graph.md

File metadata and controls

50 lines (34 loc) Β· 1.4 KB
title Relationship Graph

Relationship Graph

Link related memories with typed edges and traverse the graph.

How It Works

Memories can reference other memories using metadata relationships. This creates a directed graph where you can traverse connections.

Supported relationship types:

Edge Meaning
rel:supersedes This memory replaces an older one
rel:contradicts This memory contradicts another
rel:references This memory references another
rel:part_of This memory is part of another (component, sub-item)

Linking Memories

# Store a memory that supersedes an old one
uteke remember "API rate limit is now 2000/min" \
  --meta "rel:supersedes:old-memory-id"

Traversal

Recall with relationship traversal:

# Recall with related memories, up to 2 hops
uteke recall "rate limit" --related --depth 2

The --related flag includes connected memories in the result. --depth controls how many hops to traverse (default: 1).

Use Cases

  • Knowledge evolution β€” track when information changes and what it replaces
  • Conflict detection β€” find contradictions in your knowledge base
  • Context enrichment β€” automatically pull in related context during recall

See Also