Speed up Name Collision Check in Metadata.Builder#83340
Merged
original-brownbear merged 1 commit intoelastic:masterfrom Feb 7, 2022
original-brownbear:faster-build-metadata
Merged
Speed up Name Collision Check in Metadata.Builder#83340original-brownbear merged 1 commit intoelastic:masterfrom original-brownbear:faster-build-metadata
original-brownbear merged 1 commit intoelastic:masterfrom
original-brownbear:faster-build-metadata
Conversation
Once either indices, datastreams or their aliases become very numerous, these checks of adding everything to a fresh set and then retaining collisions become very expensive. Slightly adjusted the logic to just collect collisions instead to save endless set adding. Also refactored the logic a little to make it easier to profile the time spent on these validations and extraced some cold-paths for maybe a minor speedup.
Collaborator
|
Pinging @elastic/es-data-management (Team:Data Management) |
Contributor
Author
|
Thanks Martijn! |
97 tasks
weizijun
added a commit
to weizijun/elasticsearch
that referenced
this pull request
Feb 7, 2022
* upstream/master: [DOCS] Switch xrefs to external links (elastic#83590) [DOCS] 'features' flag added in elastic#83083 (elastic#83452) Rename ChangePolicyforIndexIT to ChangePolicyForIndexIT (elastic#83569) Fixing random_sampler tests (elastic#83549) Upgrade Checkstyle to 9.3 (elastic#83314) Make improvements to the release notes generator (elastic#83525) Cleanup DataTierAllocationDecider (elastic#83572) Upgrade jANSI dependency to 2.4.0 (elastic#83566) Speed up Name Collision Check in Metadata.Builder (elastic#83340) SQL: Add range checks to interval multiplication operation (elastic#83478) Remove DiscoveryNodes#getAllNodes (elastic#83538) Make RoutingNodes behave like a collection (elastic#83540) Remove Unused CS Listener from SecurityServerTransportInterceptor (elastic#83556)
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.
Once either indices, datastreams or their aliases become very numerous, these
checks of adding everything to a fresh set and then retaining collisions
become very expensive. Slightly adjusted the logic to just collect collisions
instead to save endless set adding.
Also refactored the logic a little to make it easier to profile the time spent
on these validations and extracted some cold-paths for maybe a minor speedup.
relates #77466