lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Erik Hatcher <e...@ehatchersolutions.com>
Subject Re: Deeply nested boolean query performance
Date Wed, 06 Apr 2005 07:49:29 GMT
Thanks Morus.

I will very soon be running experiments against a very large dataset 
using the trunk of Lucene and will report some statistics then.

	Erik

On Apr 6, 2005, at 3:26 AM, Morus Walter wrote:

> Hi Erik,
>>
>> Thanks for your very thorough response.  It is very helpful.
>>
>> For all my projects, I'm using the latest Subversion codebase and
>> staying current with any changes there, so that is very good news.
>>
> For lucene-1.4.final I find that some query on a real life index
> of the form  a AND b AND c AND d AND e AND f takes ~ 10 ms
>  a AND ( b AND ( c AND ( d AND ( e AND f ) ) ) ) ~ 42 ms
> and ( ( ( ( ( a AND b ) AND c ) AND d ) AND e ) AND f ) ~ 33 ms
>
> Queries were repeated in order to exclude any IO time. Index size ~ 1 G
> (~ 1.5 Mio documents), 6 hits.
>
> Of course that's not a systematic test, but I thought you might be 
> interested
> anyway. I don't have the time to see how this would look like using
> svn head.
>
> Morus
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
> For additional commands, e-mail: java-user-help@lucene.apache.org


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


Mime
View raw message