[
https://issues.apache.org/jira/browse/LUCENE-6815?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14907890#comment-14907890
]
Adrien Grand commented on LUCENE-6815:
--------------------------------------
Indeed. Another cost that would be interesting to take into account is the cost
of matching a Scorer (LUCENE-6276) so that we try to match the cheapest scorers
first.
> Should DisjunctionScorer advance more lazily?
> ---------------------------------------------
>
> Key: LUCENE-6815
> URL: https://issues.apache.org/jira/browse/LUCENE-6815
> Project: Lucene - Core
> Issue Type: Improvement
> Reporter: Adrien Grand
> Assignee: Adrien Grand
> Priority: Minor
>
> Today if you call DisjunctionScorer.advance(X), it will try to advance all
> sub scorers to X. However, if DisjunctionScorer is being intersected with
> another scorer (which is almost always the case as we use BooleanScorer for
> top-level disjunctions), we could stop as soon as we find one matching sub
> scorer, and only advance the remaining sub scorers when freq() or score() is
> called.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
