fix(restore): eliminate O(N^2) linear scan in getTableListByPatternLocal#1430
Open
ruslanen wants to merge 1 commit into
Open
fix(restore): eliminate O(N^2) linear scan in getTableListByPatternLocal#1430ruslanen wants to merge 1 commit into
ruslanen wants to merge 1 commit into
Conversation
addTableToListIfNotExistsOrEnrichQueryAndParts iterated the full result slice for every file processed during filepath.Walk. With 550K tables this produced N*(N-1)/2 ~ 151 billion string comparisons (~2 hours). Fix: maintain a tableIndex map[TableTitle]int alongside the result slice. Lookup and enrich are now O(1); total restore init phase drops from O(N^2) to O(N). The inline addToResult closure replaces the two local call sites; the original function is kept for the remote-restore path which operates on far fewer tables in practice.
a806ef5 to
5964ab7
Compare
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
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.
addTableToListIfNotExistsOrEnrichQueryAndParts iterated the full result slice for every file processed during filepath.Walk. With 550K tables this produced N*(N-1)/2 ~ 151 billion string comparisons (~2 hours).
Fix: maintain a tableIndex map[TableTitle]int alongside the result slice. Lookup and enrich are now O(1); total restore init phase drops from O(N^2) to O(N). The inline addToResult closure replaces the two local call sites; the original function is kept for the remote-restore path which operates on far fewer tables in practice.