Climb from dirty child IRIs to root IRIs via inverted relation edges. Query count is bounded by graph depth (one batched findParents per edge hop), not by total store size.
Climb from dirty child IRIs to root IRIs via inverted relation edges. Query count is bounded by graph depth (one batched findParents per edge hop), not by total store size.