Mailing-List: contact java-user-help@lucene.apache.org; run by ezmlm
Precedence: bulk
Reply-To: java-user@lucene.apache.org
Received-SPF: pass (hermes.apache.org: local policy)
From: Paul Elschot <paul.elschot@xs4all.nl>
To: java-user@lucene.apache.org
Subject: Re: Fastest way to fetch N documents with unique keys within large
 numbers of indexes..
Date: Wed, 8 Jun 2005 09:35:42 +0200
User-Agent: KMail/1.5.4
References: <42A4FB31.3020509@rojo.com>
 <200506070922.21027.paul.elschot@xs4all.nl> <42A62B58.3030703@rojo.com>
In-Reply-To: <42A62B58.3030703@rojo.com>
MIME-Version: 1.0
Content-Type: text/plain;
  charset="iso-8859-1"
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
Message-Id: <200506080935.42290.paul.elschot@xs4all.nl>

On Wednesday 08 June 2005 01:18, Kevin Burton wrote:
> Paul Elschot wrote:
> 
> >For a large number of indexes, it may be necessary to do this over
> >multiple indexes by first getting the doc numbers for all indexes,
> >then sorting these per index, then retrieving them
> >from all indexes, and repeating the whole thing using terms determined
> >from the retrieved docs.
> >  
> >
> Well this was a BIG win.  Just benchmarking it out shows a 10x -> 50x 
> performance increase.
> 
> Times in milliseconds:
> 
> Before:
> 
> duration: 1127
> duration: 449
> duration: 394
> duration: 564
> 
> After:
> 
> duration: 182
> duration: 39
> duration: 12
> duration: 11

There is no need for a relational db when you have Lucene :)
Thanks for reporting the old and the new times.

Regards,
Paul Elschot


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