[
https://issues.apache.org/jira/browse/LUCENE-8854?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16862929#comment-16862929
]
Michael McCandless commented on LUCENE-8854:
--------------------------------------------
{quote}moving points from a visitor API to a more cursor-style API that would
allow us to walk freely the index of the KD tree.
{quote}
+1, that would enable exactly this kind of optimization.
Maybe, it's an optional way to consume/walk the BKD tree that applies in only
certain situations.
> Can we do "doc at a time scoring" from the BKD tree for exact queries?
> ----------------------------------------------------------------------
>
> Key: LUCENE-8854
> URL: https://issues.apache.org/jira/browse/LUCENE-8854
> Project: Lucene - Core
> Issue Type: Improvement
> Reporter: Michael McCandless
> Priority: Major
>
> Random idea: normally our point queries must walk the BKD tree, building up a
> sparse or dense bitset as a 1st pass, then in 2nd pass run the "normal" query
> scorers (postings, doc values), because the docids coming out across leaf
> blocks are not in docid order, like postings and doc values.
> But, if the query is an exact point query, I think we tie break our within
> leaf block sorts by docid, and that'd even apply across multiple leaf blocks
> (if that value occurs enough times) and so for that case we could avoid the 2
> passes and do it all in one pass maybe?
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
