27 apr 2006 kl. 23.39 skrev Jean Sini:
27 apr 2006 kl. 20.44 skrev Jean Sini:
Our application presents search results in a paginated form.
We were unable to find Searcher methods that would return, say, 'n'
(typically, 10) hits after a start offset 'k'.
So we're currently using the Hits collection returned by
Searcher.search and using its Hits.doc(i) method to get the hit
You probably want to do it just the way you do.
But cache the Hits somehow.
One of the trade-offs we are considering, along the lines of what you
mentioned, has to do with whether or not to cache the Hits. The
benefit
being that we'd avoid re-running the search if requests for hits
past the
first page do come in, the cost being that we'd have to keep around
all the
hits, that are unlikely to be requested.
Have you done any tests to compare? In one case I keep about 20 000
Hits (10 minutes) in cache until it is flushed. About 60% of the
results are fetched from the cache. The processor goes from 10% to
80% idle. It consumes virtually no memory.
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
