kaivalnp commented on code in PR #13285:
URL: https://github.com/apache/lucene/pull/13285#discussion_r1689579251
##########
lucene/core/src/java/org/apache/lucene/search/AbstractVectorSimilarityQuery.java:
##########
@@ -143,27 +156,23 @@ protected boolean match(int doc) {
}
// Perform an approximate search
- TopDocs results = approximateSearch(context, acceptDocs,
cardinality);
+ TopDocs results =
+ approximateSearch(context, acceptDocs, cardinality,
timeLimitingKnnCollectorManager);
- // If the limit was exhausted
- if (results.totalHits.relation ==
TotalHits.Relation.GREATER_THAN_OR_EQUAL_TO) {
- // Return a lazy-loading iterator
- vectorSimilarityScorer =
- VectorSimilarityScorer.fromAcceptDocs(
- this,
- boost,
- createVectorScorer(context),
- new BitSetIterator(acceptDocs, cardinality),
- resultSimilarity);
- } else if (results.scoreDocs.length == 0) {
- return null;
- } else {
+ if (results.totalHits.relation == TotalHits.Relation.EQUAL_TO
+ // Return partial results only when timeout is met
+ || (queryTimeout != null && queryTimeout.shouldExit())) {
// Return an iterator over the collected results
- vectorSimilarityScorer =
- VectorSimilarityScorer.fromScoreDocs(this, boost,
results.scoreDocs);
+ return VectorSimilarityScorerSupplier.fromScoreDocs(boost,
results.scoreDocs);
+ } else {
+ // Return a lazy-loading iterator
+ return VectorSimilarityScorerSupplier.fromAcceptDocs(
Review Comment:
We tried to explore this in #12820, but the cost seemed to outweigh the
benefit
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]