lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Adrien Grand (JIRA)" <>
Subject [jira] [Commented] (LUCENE-8854) Can we do "doc at a time scoring" from the BKD tree for exact queries?
Date Wed, 12 Jun 2019 20:59:00 GMT


Adrien Grand commented on LUCENE-8854:

I can't find the issue but I think we had discussions in the past about 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. It would help support functionality like LatLonPoint#nearest (while the current implementation
only works with Lucene60PointsFormat) and maybe also this use-case?

> Can we do "doc at a time scoring" from the BKD tree for exact queries?
> ----------------------------------------------------------------------
>                 Key: LUCENE-8854
>                 URL:
>             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

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message