Orders queued paths by views, most viewed first, so mirroring moves the head of traffic off the
Worker (queue order is fill recency, uncorrelated with popularity).
Hits come from an in-memory map on the object, which costs no rows (a hits column would spend
the meter this lever protects) and is lost on eviction. A path with no hits sorts last, kept.
Orders queued paths by views, most viewed first, so mirroring moves the head of traffic off the Worker (queue order is fill recency, uncorrelated with popularity).
Hits come from an in-memory map on the object, which costs no rows (a
hitscolumn would spend the meter this lever protects) and is lost on eviction. A path with no hits sorts last, kept.