Add guidance on aggregating over large result sets - #4855
Open
thomasht86 wants to merge 1 commit into
Open
Conversation
Grouping over a large matched set, such as category counts over the full corpus, is evaluated on every matched document on every content node. Add a section to the grouping guide describing how to reduce the work per query, how to compute approximate counts from a random 1% sample using a synthetic random field, and when to cache aggregates in a Searcher. Link to it from the FAQ and the performance docs. Co-Authored-By: Claude Fable 5.1 <[email protected]>
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.
Grouping over a large matched set, such as category counts over the full corpus, is a common thing users want to do, causing issues if done frequently.
Adds a section to the grouping guide describing how to reduce the work per query, how to compute approximate counts from a random 1% sample using a synthetic random field, and when to cache aggregates in a Searcher. Link to it from the FAQ and the performance docs.
I confirm that this contribution is made under the terms of the license found in the root directory of this repository's source tree and that I have the authority necessary to make this contribution on behalf of its copyright owner.