This website uses cookies to ensure you get the best experience.
Learn more.
A relational workload frequently looks up selective records through the same nonindexed predicate. Which approach best fits?
Published
- Redesign row keys to distribute writes while preserving required access patterns.
- Evaluate an appropriate index using the query plan and write-cost tradeoff.
- Use a database transaction covering the required consistency boundary.
- Use a cache with explicit invalidation or expiration rules.
Comments — 0
Sign in to comment