[SERVER-81592] Investigate optimizing dbcheck case where skipLookupForExtraKeys is true, if we can avoid doing two index walks Created: 29/Sep/23 Updated: 08/Dec/23 |
|
| Status: | Open |
| Project: | Core Server |
| Component/s: | None |
| Affects Version/s: | None |
| Fix Version/s: | None |
| Type: | Task | Priority: | Major - P3 |
| Reporter: | Huayu Ouyang | Assignee: | Backlog - Replication Team |
| Resolution: | Unresolved | Votes: | 0 |
| Labels: | pm-855-milestone-5 | ||
| Remaining Estimate: | Not Specified | ||
| Time Spent: | Not Specified | ||
| Original Estimate: | Not Specified | ||
| Issue Links: |
|
||||||||
| Assigned Teams: |
Replication
|
||||||||
| Participants: | |||||||||
| Description |
|
Right now we do one index walk for batching + reverse lookup, and one for hashing. If we skipLookupForExtraKeys, then we still need to do the first index walk for batching and then another one for hashing. We should investigate refactoring/optimizing this and see if we can just do one. This would mean we need to move/add logic for checking batch limits into the hasher. We should wait until after |