lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Yonik Seeley <>
Subject Re: lucene 2.9 sorting algorithm
Date Thu, 15 Oct 2009 16:12:34 GMT
On Thu, Oct 15, 2009 at 11:53 AM, Yonik Seeley
<> wrote:
> And it seems like a PQ per segment simply delays many of the slow
> lookups until the end where the PQs must be merged.

Actually, I'm wrong about that part - one can simply merge on
values... there will be lots of string comparisons (and a new merge
queue) but no binary searches.

Of course a different part of the proposal  is problematic: "This way,
we avoid the lookup from value->ord, and can keep the simpler API:
ScoreDocComparator, which is much easier to extend for custom

We really don't want two different sort API's right?  So could you
still make this faster using the new comparator APIs?


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

View raw message