[jira] [Commented] (LUCENE-7641) Speed up point ranges that match most documents

["Michael McCandless (JIRA)" <ji...@apache.org>]

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

Michael McCandless commented on LUCENE-7641:
--------------------------------------------

This is a great idea!

Why do you have to compute and check the {{inverseCost}} if you already know the {{cost()}} is > {{maxDoc()/2}}?  Shouldn't the {{inverseCost}} always be around {{maxDoc()-cost()}}?

> Speed up point ranges that match most documents
> -----------------------------------------------
>
>                 Key: LUCENE-7641
>                 URL: https://issues.apache.org/jira/browse/LUCENE-7641
>             Project: Lucene - Core
>          Issue Type: Improvement
>            Reporter: Adrien Grand
>            Assignee: Adrien Grand
>            Priority: Minor
>         Attachments: LUCENE-7461.patch
>
>
> If a point range matches most documents and  every document has exactly one value, then we could make things faster by computing the set of documents that do NOT match the range instead.
> It was not possible until recently since figuring out whether a range query matches most documents was not possible, but we can now use the new {{PointValues.estimatePointcount}} API to do that: we could just check whether the cost of the inverse visitor is lower than the cost of the regular range visitor.



--
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