Marc Dauncey [mailto:[EMAIL PROTECTED]
Sent: Saturday, April 29, 2006 12:08 AM
To: java-user@lucene.apache.org
Subject: RE: Efficiently paginating results.
Hi Kinnar,
Well, I have quite a few indexes, some of which get
updated infrequently with large loads (quartley) and
then some indexes which
Regards,
>
> Kinnar
>
>
> -Original Message-
> From: Marc Dauncey [mailto:[EMAIL PROTECTED]
> Sent: Friday, April 28, 2006 8:25 PM
> To: java-user@lucene.apache.org
> Subject: Re: Efficiently paginating results.
>
> Yes, I was thinking about index up
button. It would be very kind of you if you give me a detailed view
about this..
Regards,
Kinnar
-Original Message-
From: Marc Dauncey [mailto:[EMAIL PROTECTED]
Sent: Friday, April 28, 2006 8:25 PM
To: java-user@lucene.apache.org
Subject: Re: Efficiently paginating results.
Yes, I was
I'm caching hits by query. When accessing more documents Lucene
automatically re-quering index to retrieve more document.
When index changes then I reopen IndexReader and clear cache.
Marc Dauncey wrote:
I read somewhere recently (maybe even on this list) a
recommendation to requery each time f
p.s. To avoid that issue you could store the result-sets document ids in
the session.
Marc Dauncey schrieb:
Yes, I was thinking about index updates.
Getting a different result set when you go back to a
previous page might be an issue - could always cache
each page as its opened rather than
Yes, I was thinking about index updates.
Getting a different result set when you go back to a
previous page might be an issue - could always cache
each page as its opened rather than the entire result
set.
--- Hannes Carl Meyer <[EMAIL PROTECTED]> wrote:
> Hi Marc,
>
> I'm using this met
Hi Marc,
I'm using this method for a web-application. I'm storing only the
current viewable set of documents in the session and re-query if the user
scrolls to the next page. This method is pretty fast and has a minimal
session- and processing-footprint. But, if your index is changed during
scr
I read somewhere recently (maybe even on this list) a
recommendation to requery each time for successive
pages as this avoids some of the complexity involved
in session management. Whats peoples view of this?
Marc
--- karl wettin <[EMAIL PROTECTED]> wrote:
>
> 27 apr 2006 kl. 20.44 skrev Jean
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 colle
nd only re-running the search if it has been
evicted from that cache.
Jean
-Original Message-
From: karl wettin [mailto:[EMAIL PROTECTED]
Sent: Thursday, April 27, 2006 12:09 PM
To: java-user@lucene.apache.org
Subject: Re: Efficiently paginating results.
27 apr 2006 kl. 20.44 skrev
On 4/27/06, Jean Sini <[EMAIL PROTECTED]> wrote:
> We were unable to find Searcher methods that would return, say, 'n'
> (typically, 10) hits after a start offset 'k'.
Yes, that's because to find results k through k+n, Lucene must first
find results 0 through k+n.
> So we're currently using the H
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
12 matches
Mail list logo
