A relational workload frequently looks up selective records through the same nonindexed predicate. Which approach best fits?

1. Use a database transaction covering the required consistency boundary.
2. Redesign row keys to distribute writes while preserving required access patterns.
3. Use a cache with explicit invalidation or expiration rules.
4. Evaluate an appropriate index using the query plan and write-cost tradeoff.