Three compute techniques that run on the node that owns the key: broadcast with local scan, single-key affinityCall, and cross-cache affinityCall. A scale experiment from 1,000 to 100,000 customers prints wall-clock and byte counts for each approach against pull-to-client.
Three mechanisms control where related entries live in the cluster: composite keys with @AffinityKeyMapped, the AffinityKey wrapper, and CacheKeyConfiguration. Run all three against a Customer and Invoice schema, watch each produce the same colocation outcome, and learn which to pick for a real schema.
Colocation fails silently. Three verification techniques prove a running cache is wired correctly before a bug reaches production: the Affinity runtime API, SYS.CACHE_GROUPS and SYS.PARTITION_STATES system views, and a per-node local scan that catches orphan rows.