Replace the timestamp array with min/max bounds so the btree does not re-sort the array on every index rescan, and return to the plain primary-key join with materialized inputs instead of a lateral subquery.