generated from amazon-archives/__template_Custom
-
Notifications
You must be signed in to change notification settings - Fork 169
Add expandNested support to "exact_knn" query clause #2848
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
kaushikau
wants to merge
2
commits into
opensearch-project:feature/exact-search-new-experience
Choose a base branch
from
kaushikau:expand-nested-exact-knn
base: feature/exact-search-new-experience
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
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
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
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
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
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
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
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
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
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -17,19 +17,23 @@ | |
* This iterator iterates filterIdsArray to scoreif filter is provided else it iterates over all docs. | ||
* However, it dedupe docs per each parent doc | ||
* of which ID is set in parentBitSet and only return best child doc with the highest score. | ||
* When expandNested is true, it returns ALL child docs instead of just the best one. | ||
*/ | ||
public class NestedBinaryVectorIdsKNNIterator extends BinaryVectorIdsKNNIterator { | ||
private final BitSet parentBitSet; | ||
private final boolean expandNested; | ||
|
||
public NestedBinaryVectorIdsKNNIterator( | ||
@Nullable final DocIdSetIterator filterIdsIterator, | ||
final byte[] queryVector, | ||
final KNNBinaryVectorValues binaryVectorValues, | ||
final SpaceType spaceType, | ||
final BitSet parentBitSet | ||
final BitSet parentBitSet, | ||
final boolean expandNested | ||
) throws IOException { | ||
super(filterIdsIterator, queryVector, binaryVectorValues, spaceType); | ||
this.parentBitSet = parentBitSet; | ||
this.expandNested = expandNested; | ||
} | ||
|
||
public NestedBinaryVectorIdsKNNIterator( | ||
|
@@ -40,20 +44,34 @@ public NestedBinaryVectorIdsKNNIterator( | |
) throws IOException { | ||
super(null, queryVector, binaryVectorValues, spaceType); | ||
this.parentBitSet = parentBitSet; | ||
this.expandNested = false; | ||
} | ||
|
||
/** | ||
* Advance to the next best child doc per parent and update score with the best score among child docs from the parent. | ||
* When expandNested is true, returns ALL child docs instead of just the best one. | ||
* DocIdSetIterator.NO_MORE_DOCS is returned when there is no more docs | ||
* | ||
* @return next best child doc id | ||
* @return next child doc id (best child when expandNested=false, all children when expandNested=true) | ||
*/ | ||
@Override | ||
public int nextDoc() throws IOException { | ||
if (docId == DocIdSetIterator.NO_MORE_DOCS) { | ||
return DocIdSetIterator.NO_MORE_DOCS; | ||
} | ||
|
||
if (expandNested) { | ||
int currentParent = parentBitSet.nextSetBit(docId); | ||
if (currentParent != DocIdSetIterator.NO_MORE_DOCS && docId < currentParent) { | ||
currentScore = computeScore(); | ||
int currentDocId = docId; | ||
docId = getNextDocId(); | ||
return currentDocId; | ||
} | ||
docId = getNextDocId(); | ||
return nextDoc(); | ||
Comment on lines
+71
to
+72
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Just for clarification, what case is this handling? I think if it hits this case then docId will already be -1 right? is it safe to return no more docs here? |
||
} | ||
|
||
currentScore = Float.NEGATIVE_INFINITY; | ||
int currentParent = parentBitSet.nextSetBit(docId); | ||
int bestChild = -1; | ||
|
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
Oops, something went wrong.
Oops, something went wrong.
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
will there be a case where docId won't be less than parent? it will either be NO_MORE_DOCS or less than parent right?