It tokenizes a text string into Lucene search objects.
How long is your search string (how many terms)?
How large is your index (number of terms would be great to know also)?
On Tuesday, December 10, 2002, at 07:59 AM, [EMAIL PROTECTED] wrote:
Hey guys,
We have a question about how the QueryParser class optimizes searches, if it
does at all. We have some searches that are taking an abnormal amount of
time. Our search string specifies 3-4 fields separated by ORs with a single
term each, and another field searching for many terms separated by a bunch
of ORs. So it looks kind of like this:
Field1:( term1 term2 term3 term4 ... termN ) && ( Field2: termx || Field3:
termy || Field4: termz ) )
Does the QueryParser class do anything to optimize its search for this? Or
is there a better way to do this?
Thanx.
Roy.
This email and any attachments are confidential and may be
legally privileged. No confidentiality or privilege is waived
or lost by any transmission in error. If you are not the
intended recipient you are hereby notified that any use,
printing, copying or disclosure is strictly prohibited.
Please delete this email and any attachments, without
printing, copying, forwarding or saving them and notify the
sender immediately by reply e-mail. Zurich Capital Markets
and its affiliates reserve the right to monitor all e-mail
communications through its networks. Unless otherwise
stated, any pricing information in this e-mail is indicative
only, is subject to change and does not constitute an offer
to enter into any transaction at such price and any terms in
relation to any proposed transaction are indicative only and
subject to express final confirmation.
-- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
