Sounds good. Thanks for all the help.
Shawn.
-Original Message-
From: Paul Elschot [mailto:[EMAIL PROTECTED]
Sent: Monday, September 20, 2004 4:22 PM
To: [EMAIL PROTECTED]
Subject: Re: Too many boolean clauses
On Monday 20 September 2004 20:54, Shawn Konopinsky wrote:
> Hey P
On Monday 20 September 2004 20:54, Shawn Konopinsky wrote:
> Hey Paul,
>
...
>
> Also - we are using a pooling feature which contains a pool of
> IndexSearchers that are used and tossed back each time we need to search.
> I'd hate to have to work around this and open up an IndexReader for this
> pa
On Monday 20 September 2004 20:54, Shawn Konopinsky wrote:
> Hey Paul,
>
> Thanks for the quick reply. Excuse my ignorance, but what do I do with the
> generated BitSet?
You can return it in in the bits() method of the object implementing your
org.apache.lucene.search.Filter (http://jakarta.apache
up an IndexReader for this
particular search, where all other searches use the pool. Suggestions?
Thanks,
Shawn.
-Original Message-
From: Paul Elschot [mailto:[EMAIL PROTECTED]
Sent: Monday, September 20, 2004 12:51 PM
To: Lucene Users List
Subject: Re: Too many boolean clauses
On Mond
On Monday 20 September 2004 18:27, Shawn Konopinsky wrote:
> Hello There,
>
> Due to the fact that the [# TO #] range search works lexographically, I am
> forced to build a rather large boolean query to get range data from my
> index.
>
> I have an ID field that contains about 500,000 unique ids. I
