Currently, no optimisations are performed on query trees other than the flattening of like disjunctions via associativity, i.e. (or a (or b c)) -> (or a b c). It should be investigated whether further optimisations can be made, both from the perspective of set logic, and from the perspective of SQL.
Currently, no optimisations are performed on query trees other than the flattening of like disjunctions via associativity, i.e.
(or a (or b c)) -> (or a b c). It should be investigated whether further optimisations can be made, both from the perspective of set logic, and from the perspective of SQL.