-
Notifications
You must be signed in to change notification settings - Fork 5.8k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
session: optimize the sharding algorithm for non-transactional DMLs #34050
Conversation
Signed-off-by: ekexium <ekexium@gmail.com>
[REVIEW NOTIFICATION] This pull request has been approved by:
To complete the pull request process, please ask the reviewers in the list to review by filling The full list of commands accepted by this bot can be found here. Reviewer can indicate their review by submitting an approval review. |
Code Coverage Details: https://codecov.io/github/pingcap/tidb/commit/5e097cf79ae06067959aca70dbb4a26540dde636 |
Signed-off-by: ekexium <ekexium@gmail.com>
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
rest LGTM
Signed-off-by: ekexium <ekexium@gmail.com>
/merge |
This pull request has been accepted and is ready to merge. Commit hash: ec81234
|
/run-unit-test |
TiDB MergeCI notify🔴 Bad News! [2] CI still failing after this pr merged.
|
Signed-off-by: ekexium ekexium@gmail.com
What problem does this PR solve?
Issue Number: ref #33485
Problem Summary:
Use an accurate sharding algorithm that makes the best effort to make the actual batch size equal to the batch size specified by the user.
Using the original algorithm, when there are duplicated values, the worst case can be a super large batch containing all values. The PR avoids such cases.
What is changed and how it works?
Check List
Tests
Side effects
Documentation
Release note
Please refer to Release Notes Language Style Guide to write a quality release note.