[
https://issues.apache.org/jira/browse/LUCENE-6184?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14278794#comment-14278794
]
Robert Muir commented on LUCENE-6184:
-------------------------------------
The trickiest part here are the new semantics of the return value. But
FilteredQuery has a code comment that maybe should be moved to BulkScorer's
docs to help elaborate (there is a small typo too in the comment).
Can this lead to a better minshouldmatch impl for booleanscorer? I'm just as
happy with it removed too, but i know a while ago we benchmarked that BS1 can
still be faster for that query, so its just a possibility. Maybe it should just
stay as a pure disjunction scorer.
> BooleanScorer should better deal with sparse clauses
> ----------------------------------------------------
>
> Key: LUCENE-6184
> URL: https://issues.apache.org/jira/browse/LUCENE-6184
> Project: Lucene - Core
> Issue Type: Improvement
> Reporter: Adrien Grand
> Assignee: Adrien Grand
> Priority: Minor
> Fix For: Trunk, 5.1
>
> Attachments: LUCENE-6184.patch
>
>
> The way that BooleanScorer works looks like this:
> {code}
> for each (window of 2048 docs) {
> for each (optional scorer) {
> scorer.score(window)
> }
> }
> {code}
> This is not efficient for very sparse clauses (doc freq much lower than
> maxDoc/2048) since we keep on scoring windows of documents that do not match
> anything. BooleanScorer2 currently performs better in those cases.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
