You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@lucene.apache.org by "Michael McCandless (JIRA)" <ji...@apache.org> on 2019/06/12 19:59:00 UTC
[jira] [Created] (LUCENE-8854) Can we do "doc at a time scoring"
from the BKD tree for exact queries?
Michael McCandless created LUCENE-8854:
------------------------------------------
Summary: 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
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: dev-unsubscribe@lucene.apache.org
For additional commands, e-mail: dev-help@lucene.apache.org