lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Rasik Pandey" <rasik.pan...@ajlsm.com>
Subject RE : RE : ReSorting
Date Wed, 26 May 2004 17:04:23 GMT
> Ran some informal tests.  Eric, you are definitely right, it is
> faster to search again, assuming you don't already have an
> advanced caching system in place.   The other tradeoff to
> consider is the size of the sort cache, which the docs say is:
> 4 * IndexReader.maxDoc() * (# of different fields actually used
> to sort).  As for simplicity, Tim's sorting code is the way to
> go as it is already native to Lucene, saving developer's from
> having to write their own.
> 
> On a side note, it was a real eye opener to see the value of a
> tightly written comparator function in sorting performance.
> One should be careful about how they implement a comparator.

Thanks Eric for the tips and thanks Grant for the informal empirical...

Regards,
RBP



---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-dev-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-dev-help@jakarta.apache.org


Mime
View raw message