You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@lucene.apache.org by "Terry Smith (JIRA)" <ji...@apache.org> on 2015/09/24 16:22:04 UTC

[jira] [Commented] (LUCENE-6815) Should DisjunctionScorer advance more lazily?

    [ https://issues.apache.org/jira/browse/LUCENE-6815?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14906401#comment-14906401 ] 

Terry Smith commented on LUCENE-6815:
-------------------------------------

Additionally, I don't see DisiPriorityQueue taking the cost of each scorer into account. I'd imagine that the scorer with highest cost is more likely to be a hit which would make this kind of lazy advancing even better.


> 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: dev-unsubscribe@lucene.apache.org
For additional commands, e-mail: dev-help@lucene.apache.org