That helped a lot! Thanks so much Erick.
Guido
-Original Message-
From: Erick Erickson [mailto:erickerick...@gmail.com]
Sent: Friday, January 30, 2015 7:04 PM
To: java-user
Subject: Re: Project configuration issue
Why not fire the "ant eclipse" target and open the resulting Eclipse conf
Hello,
I did not know what the right mailing list would be (java-user vs solr-user),
so mailing both.
My group uses solr/lucene, and we have custom collectors.
I stumbled upon the implementation of SolrIndexSearcher.java and saw this :
https://github.com/apache/lucene-solr/blob/trunk/solr/cor
In general: BooleanQuery is a bad name, because it is not "just" Boolean
algebra:
- There are also "Boosts" involved
- Also, the algebra consists of MUST, MUST_NOT and SHOULD. You cannot transform
this easily to classical mathematical algebra :-)
See also: https://lucidworks.com/blog/why-not-and
The question here is: is a 'smaller' boolean query consuming less ressources?
Gruss, Ralf
Gesendet vom Mobiltelefon
Originalnachricht
Von: Ralf Heyde
Gesendet: Montag, 2. Februar 2015 16:28
An: java-user@lucene.apache.org; java-user@lucene.apache.org
Antwort an: java-user@lucene.apache.org
Just an idea: could it be optimized by boolean Algebra?
Gruss, Ralf
Gesendet vom Mobiltelefon
Originalnachricht
Von: Uwe Schindler
Gesendet: Montag, 2. Februar 2015 16:25
An: java-user@lucene.apache.org
Antwort an: java-user@lucene.apache.org
Betreff: RE: Lucene Boolean Query Minimization
Hi,
You don't give an example of the type of Boolean query you want to "minimize".
I have no idea "how" it could be optimized without that information. If a
Boolean query contains only one clause, it is rewritten automatically to be the
query of its single clause (with boosts multiplied). But i
Hey all,
I have a large boolean query in lucene which can be minimized to a smaller
version with fewer clauses. Does Lucene automatically minimize complex
boolean queries to simpler versions before executing them?
If not, are there are predefined ways to do so?
--
Regards,
Apurv
