---
id: define-call-graph-retention
name: Define Call Graph Retention Policy
status: completed
depends_on: []
scope: narrow
risk: low
impact: component
level: implementation
---

## Description

W09: Call graph data grows unboundedly — every operation invocation creates a node and edges. CASCADE handles cleanup on node deletion, but nothing deletes old nodes. README.md acknowledges this as Open Question #5 but no approach is specified.

Specify the intended approach: TTL-based deletion, archival to cold storage, or aggregation + deletion. Even a phased notation ("v1: manual cleanup, v2: automatic TTL") helps implementers understand the plan.

## Acceptance Criteria

- [ ] `call-graph.md` includes a "Retention Policy" section
- [ ] Short-term approach specified (e.g., manual cleanup or no cleanup for v1)
- [ ] Long-term approach outlined (e.g., TTL-based, aggregation + deletion)
- [ ] README.md Open Question #5 resolved with cross-reference to call-graph.md section

## References

- docs/reviews/storage-architecture-review-2026-04-21.md#W09
- docs/architecture/storage/call-graph.md
- docs/architecture/storage/README.md (Open Question #5)

## Notes

> To be filled by implementation agent

## Summary

> To be filled on completion