[KongchangAI]
Concept

Graph Memory

A dynamically updated graph-structured memory mechanism that continuously writes new nodes and edges and decays or prunes old edges as a conversation or task proceeds. It can evolve continuously, but it requires maintaining consistency and controlling graph size growth.

Timeline (last 90 days)

Nov 6

Compared with vector retrieval, graph memory can explicitly constrain person attribution, filter edges by temporal conditions, and preserve the history of state evolution through chained paths.

Unverified50%
Nov 5

The exploration process naturally forms a graph structure, in which different branch approaches are interconnected through revision and reconsideration; if a memory system stores dialogues only in a flat timeline, cross-branch reference relationships are lost.

Unverified50%
Nov 5

Static graph indexes are suitable for knowledge-intensive retrieval, with low update cost but difficulty reflecting the latest state; dynamic graph memory can continuously evolve but requires maintaining consistency, controlling graph size explosion, and deciding when to merge or forget.

Unverified50%
Oct 19

Storing a player's Q&A history and playstyle tags as graph nodes linked to riot_id gives the AI long-term memory across matches; compared with stuffing conversation history into the context window, graph memory turns player preferences into queryable structured facts.

Unverified50%

All Facts (4)

Source Articles