[
https://issues.apache.org/jira/browse/LUCENE-6926?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15056628#comment-15056628
]
Paul Elschot commented on LUCENE-6926:
--------------------------------------
I was thinking about using the cost of an excluded clause as (N - cost), and
then being consistent with ConjunctionScorer.
But we could also just wrap each MUST_NOT clause so it becomes a normal non
scoring boolean clause. The wrapper would only implement NOT.
Then ConjunctionScorer can do the sorting and the wrapped MUST_NOT would
normally come last, just like the normal case here.
Since the current ReqExclScorer is also a wrapper, I would expect that a
wrapper for each excluded clause has similar performance. This might also
simplify BooleanWeight.
Does that sound feasible?
> Take matchCost into account for MUST_NOT clauses
> ------------------------------------------------
>
> Key: LUCENE-6926
> URL: https://issues.apache.org/jira/browse/LUCENE-6926
> Project: Lucene - Core
> Issue Type: Improvement
> Reporter: Adrien Grand
> Assignee: Adrien Grand
> Priority: Minor
> Attachments: LUCENE-6926.patch, LUCENE-6926.patch
>
>
> ReqExclScorer potentially has two TwoPhaseIterators to check: the one for the
> positive clause and the one for the negative clause. It should leverage the
> match cost API to check the least costly one first.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
