lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "ASF subversion and git services (JIRA)" <>
Subject [jira] [Commented] (LUCENE-7939) Speed up MinShouldMatchSumScorer in conjunctions
Date Wed, 23 Aug 2017 17:21:00 GMT


ASF subversion and git services commented on LUCENE-7939:

Commit 586270a76990f6462c688e79ab85cf16df28b8a8 in lucene-solr's branch refs/heads/branch_7x
from [~jpountz]
[;h=586270a ]

LUCENE-7939: Speed up MinShouldMatchSumScorer in conjunctions.

> Speed up MinShouldMatchSumScorer in conjunctions
> ------------------------------------------------
>                 Key: LUCENE-7939
>                 URL:
>             Project: Lucene - Core
>          Issue Type: Improvement
>            Reporter: Adrien Grand
>            Priority: Minor
>             Fix For: master (8.0), 7.1
>         Attachments: LUCENE-7939.patch, LUCENE-7939.patch
> MinShouldMatchSumScorer has good iteration capabilities, but if it is not used as a lead
for the iteration then the advance() call might make a lot of efforts in order to find the
next match while we should instead let the lead iterator of the conjunction skip over non-matching
documents. In this issue I'd like to explore changing MinShouldMatchSumScorer by giving it
a two-phase iterator and making advance() return a candidate for the next match that is less
good but much cheaper to compute.

This message was sent by Atlassian JIRA

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message