lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ralf Heyde <>
Subject AW: Lucene Boolean Query Minimization
Date Mon, 02 Feb 2015 15:27:46 GMT
Just an idea: could it be optimized by boolean Algebra?

Gruss, Ralf

Gesendet vom Mobiltelefon
Von: Uwe Schindler
Gesendet: Montag, 2. Februar 2015 16:25
Antwort an:
Betreff: RE: Lucene Boolean Query Minimization


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 if you have many Boolean clauses, how could those be optimized? If you have multiple term
queries as clauses with identical terms, one could optimize that by merging those clauses
and add their boosts, but this is not done automatically.


Uwe Schindler
H.-H.-Meier-Allee 63, D-28213 Bremen

> -----Original Message-----
> From: Apurv Verma []
> Sent: Monday, February 02, 2015 11:31 AM
> To:
> Subject: Lucene Boolean Query Minimization
> 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

To unsubscribe, e-mail:
For additional commands, e-mail:

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message