Karl Wettin wrote:
>
>
> After sleeping on this it hit me that you might be able to save a bit
> of CPU ticks by decorating queries and bypassing the scorer rather
> than evaluating the score and then multiply it with 0. Probably not
> too much though. Not much but might be worth mentioning.
>
>
A couple of years ago I created a "ConjuctionSearcher" that did pretty much
the same job as ConjuctionScorer but did no scoring at all. Admittedly I
did no optimisation on it - just used standard collections etc - and found
it performed about 10% faster. That was less than I hoped for so I didn't
bother taking it any further. But I guess for some people a 10% saving
could be significant.
--
View this message in context:
http://www.nabble.com/Mixing-non-scored-an-scored-queries-tp18460018p18492642.html
Sent from the Lucene - Java Users mailing list archive at Nabble.com.
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
