As I am always looking for ways to enhance a searches response time, if
I were to use the MultiReader as suggested, would it still be possible
to determine which index a hit came from? Currently I use the
MultiSearcher.subSearcher() method to determine this information. After
taking a, albei
: > IndexSearcher[] searchers;
: > searchers=new IndexSearcher[3];
: > String path="/home/sn/public_html/";
: > searchers[0]=new IndexSearcher(path+"index1");
: > searchers[1]=new IndexSearcher(path+"index2");
: > searchers[2]=new IndexSearcher(path+"
Glad I could help. I don't read a word of German, but even I could see the
227 milliseconds at the bottom .
Glad things are working for you.
Erick
On 9/26/06, Gaston <[EMAIL PROTECTED]> wrote:
Hi Erick,
the problem was this piece of code I don't need anymore.
for(int i=0;ihttp://www.suchste.
Hi Erick,
the problem was this piece of code I don't need anymore.
for(int i=0;iNow it is very fast, thank you very much for your email that is written
in detail.
Here is my application, that still is in development phase.
http://www.suchste.de
Greetings Gaston
P.S. The search for 'web' del
See below.
On 9/26/06, Gaston <[EMAIL PROTECTED]> wrote:
hi,
first thank you for the fast reply.
I use MultiSearcher that opens 3 indexes, so this makes the whole
operation surly slower, but 20seconds for 5260 results out of an 212MB
index is much too slow.
Another reason can of course be m
hi,
first thank you for the fast reply.
I use MultiSearcher that opens 3 indexes, so this makes the whole
operation surly slower, but 20seconds for 5260 results out of an 212MB
index is much too slow.
Another reason can of course be my ISP.
Here is my code:
IndexSearcher[] searcher
Well, my index is over 1.4G, and others are reporting very large indexes in
the 10s of gigabytes. So I suspect your index size isn't the issue. I'd be
very, very, very surprised if it was.
Three things spring immediately to mind.
First, opening an IndexSearcher is a slow operation. Are you openi
Hi,
Lucene has itself volatile caching mechanism provided by a weak
HashMap. Is there a possibilty to serialize the Hits Object? I think of
a HashMap that for each found result, caches the first 100 results. Is
it possible to implement such a feature or is there such an extension?
My problem
