sp_QuickieCache: CPU tie-breaker for duplicate plans sort#756
Merged
erikdarlingdata merged 1 commit intomainfrom Apr 6, 2026
Merged
sp_QuickieCache: CPU tie-breaker for duplicate plans sort#756erikdarlingdata merged 1 commit intomainfrom
erikdarlingdata merged 1 commit intomainfrom
Conversation
Within the same plan_count, sort by total_worker_time DESC so the most expensive query hash surfaces first. Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
total_worker_time DESCas tie-breaker when multiple query hashes share the same plan countTest plan
🤖 Generated with Claude Code