Repository navigation
Add exact-count full-text coverage to Big5 - #832
Merged
OVI3D0 merged 2 commits intoSep 25, 2026
Merged
Conversation
Signed-off-by: Michael Oviedo <mikeovi@amazon.com>
Signed-off-by: Michael Oviedo <mikeovi@amazon.com>
OVI3D0
marked this pull request as ready for review
September 24, 2026 22:47
OVI3D0
requested review from
IanHoang,
VijayanB,
beaioun,
gkamat and
rishabh6788
as code owners
September 24, 2026 22:47
rishabh6788
approved these changes
Sep 24, 2026
asimmahmood1
approved these changes
Sep 24, 2026
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.
Description
Adds five exact-count full-text operations to the default Big5 test procedure:
messagefieldmessagepatterns selected from the live Big5 term dictionaryEach operation uses
size: 0,track_total_hits: true, andrequest_cache=falseso the benchmark exercises exhaustive collection instead of top-k pruning or cached whole responses. This fills the routine performance coverage gap highlighted by opensearch-project/OpenSearch#23117, including bulk postings iteration and postings reuse during multi-term expansion.The multi-term patterns each expand beyond the 1,024 Boolean-clause limit per shard when inspected with a scoring Boolean rewrite, confirming that they exercise substantial term expansion.
Issues Resolved
Related to opensearch-project/OpenSearch#23117 and opensearch-project/OpenSearch#23107.
Testing
Local validation:
opensearch-benchmark list workloads --workload-path <checkout>/big5 --distribution-version 3.8.0opensearch-benchmark info --workload-path <checkout>/big5 --test-procedure big5 --include-tasks high-frequency-and-count,high-frequency-or-count,prefix-count,wildcard-count,regexp-countFull-corpus validation:
Backport to Branches:
By submitting this pull request, I confirm that my contribution is made under the terms of the Apache 2.0 license.
For more information on following Developer Certificate of Origin and signing off my commits, see the OpenSearch contributing documentation.