18 maj 2008 kl. 02.25 skrev John Jensen:
Hi,
I have an application where I need to issue queries with a large
number of
or-terms with individual boosts.
Currently I just construct a BooleanQuery with a large number (often
1000)
of constituent TermQueries. I'm wondering if there is a
The only problem is, that I'm thinking that a special purpose Query subclass
might be faster, but I was wondering if others have run into similar
situations, and whether they saw performance win by replacing complex
BooleanQueries with a special purpose Query subclass.
Unfortunately the boosts
See below.
Op Sunday 18 May 2008 21:03:19 schreef John Jensen:
The only problem is, that I'm thinking that a special purpose Query
subclass might be faster, but I was wondering if others have run into
similar situations, and whether they saw performance win by replacing
complex BooleanQueries
Hi,
I have an application where I need to issue queries with a large number of
or-terms with individual boosts.
Currently I just construct a BooleanQuery with a large number (often 1000)
of constituent TermQueries. I'm wondering if there is a better way to do
this?
I'm open to implementing my
