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 better way
to do
this?
I'm open to implementing my own Query subclass if I can expect
significant
performance improvements from doing this.
What is the general problem with your approach? And what does all
these boosted term queries represent?
Would it be perhaps be possible for you to add the boost at index time
instead of at query time?
karl
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
