daniel rosher <daniel.rosher <at> hotonline.com> writes: > > We regularly open a new IndexReader, and before this reader replaces the > production one, we determine f(D) for all documents so that for the user > there is almost no performance issue,i.e. f(D) is cached. I suspect you > can implement something similar. > > Cheers, > Dan >
But if f(D) is dependent on the query, how can it be precomputed and cached? Can I get a sorted hits enumerator from IndexReader, and just compute the scores of the top N hits and resort them? -Xiong --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
