Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

optimize queries where lhs and rhs of predicate are equal #10444

Merged
merged 9 commits into from
Mar 28, 2023
Original file line number Diff line number Diff line change
Expand Up @@ -170,6 +170,8 @@ private void validateQueries() {
for (String queryString : _queryWeightMap.keySet()) {
try {
PinotQuery pinotQuery = CalciteSqlParser.compileToPinotQuery(queryString);
// TODO: we should catch and log errors here so we don't fail queries on optimization.
// For now, because this modifies the query in place, we let the error propagate.
_queryOptimizer.optimize(pinotQuery, _schema);
QueryContext queryContext = QueryContextConverterUtils.getQueryContext(pinotQuery);

Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -26,6 +26,7 @@
import org.apache.pinot.common.request.PinotQuery;
import org.apache.pinot.core.query.optimizer.filter.FilterOptimizer;
import org.apache.pinot.core.query.optimizer.filter.FlattenAndOrFilterOptimizer;
import org.apache.pinot.core.query.optimizer.filter.IdenticalPredicateFilterOptimizer;
import org.apache.pinot.core.query.optimizer.filter.MergeEqInFilterOptimizer;
import org.apache.pinot.core.query.optimizer.filter.MergeRangeFilterOptimizer;
import org.apache.pinot.core.query.optimizer.filter.NumericalFilterOptimizer;
Expand All @@ -43,8 +44,9 @@ public class QueryOptimizer {
// - TimePredicateFilterOptimizer and MergeRangeFilterOptimizer relies on NumericalFilterOptimizer to convert the
// values to the proper format so that they can be properly parsed
private static final List<FilterOptimizer> FILTER_OPTIMIZERS =
Arrays.asList(new FlattenAndOrFilterOptimizer(), new MergeEqInFilterOptimizer(), new NumericalFilterOptimizer(),
new TimePredicateFilterOptimizer(), new MergeRangeFilterOptimizer());
Arrays.asList(new FlattenAndOrFilterOptimizer(), new IdenticalPredicateFilterOptimizer(),
new MergeEqInFilterOptimizer(), new NumericalFilterOptimizer(), new TimePredicateFilterOptimizer(),
new MergeRangeFilterOptimizer());

private static final List<StatementOptimizer> STATEMENT_OPTIMIZERS =
Collections.singletonList(new StringPredicateFilterOptimizer());
Expand Down
Original file line number Diff line number Diff line change
@@ -0,0 +1,141 @@
/**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package org.apache.pinot.core.query.optimizer.filter;

import java.util.List;
import javax.annotation.Nullable;
import org.apache.pinot.common.request.Expression;
import org.apache.pinot.common.request.ExpressionType;
import org.apache.pinot.common.request.Function;
import org.apache.pinot.common.request.Literal;
import org.apache.pinot.common.utils.request.RequestUtils;
import org.apache.pinot.spi.data.Schema;
import org.apache.pinot.sql.FilterKind;


/**
* This base class acts as a helper for any optimizer that is effectively removing filter conditions.
* It provides TRUE/FALSE literal classes that can be used to replace filter expressions that are always true/false.
* It provides an optimization implementation for AND/OR/NOT expressions.
*/
public abstract class BaseAndOrBooleanFilterOptimizer implements FilterOptimizer {

protected static final Expression TRUE = RequestUtils.getLiteralExpression(true);
protected static final Expression FALSE = RequestUtils.getLiteralExpression(false);

/**
* This recursively optimizes each part of the filter expression. For any AND/OR/NOT,
* we optimize each child, then we optimize the remaining statement. If there is only
* a child statement, we optimize that.
*/
@Override
public Expression optimize(Expression filterExpression, @Nullable Schema schema) {
if (!canBeOptimized(filterExpression, schema)) {
return filterExpression;
}

Function function = filterExpression.getFunctionCall();
List<Expression> operands = function.getOperands();
FilterKind kind = FilterKind.valueOf(function.getOperator());
switch (kind) {
case AND:
case OR:
case NOT:
// Recursively traverse the expression tree to find an operator node that can be rewritten.
operands.forEach(operand -> optimize(operand, schema));
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Let's use replaceAll() here so that it still works when the optimize is not applied inplace

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

done


// We have rewritten the child operands, so rewrite the parent if needed.
return optimizeCurrent(filterExpression);
default:
return optimizeChild(filterExpression, schema);
}
}

abstract boolean canBeOptimized(Expression filterExpression, @Nullable Schema schema);

/**
* Optimize any cases that are not AND/OR/NOT. This should be done by converting any cases
* that are always true to TRUE or always false to FALSE.
*/
abstract Expression optimizeChild(Expression filterExpression, @Nullable Schema schema);

/**
* If any of the operands of AND function is "false", then the AND function itself is false and can be replaced with
* "false" literal. Otherwise, remove all the "true" operands of the AND function. Similarly, if any of the operands
* of OR function is "true", then the OR function itself is true and can be replaced with "true" literal. Otherwise,
* remove all the "false" operands of the OR function.
*/
protected Expression optimizeCurrent(Expression expression) {
Function function = expression.getFunctionCall();
String operator = function.getOperator();
List<Expression> operands = function.getOperands();
if (operator.equals(FilterKind.AND.name())) {
// If any of the literal operands are always false, then replace AND function with FALSE.
for (Expression operand : operands) {
if (isAlwaysFalse(operand)) {
return FALSE;
}
}

// Remove all Literal operands that are always true.
operands.removeIf(this::isAlwaysTrue);
if (operands.isEmpty()) {
return TRUE;
}
} else if (operator.equals(FilterKind.OR.name())) {
// If any of the literal operands are always true, then replace OR function with TRUE
for (Expression operand : operands) {
if (isAlwaysTrue(operand)) {
return TRUE;
}
}

// Remove all Literal operands that are always false.
operands.removeIf(this::isAlwaysFalse);
if (operands.isEmpty()) {
return FALSE;
}
} else if (operator.equals(FilterKind.NOT.name())) {
assert operands.size() == 1;
Expression operand = operands.get(0);
if (isAlwaysTrue(operand)) {
return FALSE;
}
if (isAlwaysFalse(operand)) {
return TRUE;
}
}
return expression;
}

private boolean isAlwaysFalse(Expression operand) {
return operand.equals(FALSE);
}

private boolean isAlwaysTrue(Expression operand) {
return operand.equals(TRUE);
}
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

(nit) Slightly more readable if we just inline them or rename to isTrue() and isFalse()

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

good point. it made more sense in the initial PR


/** Change the expression value to boolean literal with given value. */
protected static void setExpressionToBoolean(Expression expression, boolean value) {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Not introduced in this PR, but let's remove this method since we should avoid mutating an expression. We can use the constant TRUE and FALSE instead

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

done. There's still some more mutation in NumericalFilterOptimizer, but this gets rid of a big part

expression.unsetFunctionCall();
expression.setType(ExpressionType.LITERAL);
expression.setLiteral(Literal.boolValue(value));
}
}
Original file line number Diff line number Diff line change
Expand Up @@ -40,6 +40,9 @@ public Expression optimize(Expression filterExpression, @Nullable Schema schema)

private Expression optimize(Expression filterExpression) {
Function function = filterExpression.getFunctionCall();
if (function == null) {
Jackie-Jiang marked this conversation as resolved.
Show resolved Hide resolved
return filterExpression;
}
String operator = function.getOperator();
if (!operator.equals(FilterKind.AND.name()) && !operator.equals(FilterKind.OR.name())) {
return filterExpression;
Expand All @@ -50,7 +53,7 @@ private Expression optimize(Expression filterExpression) {
for (Expression child : children) {
Expression optimizedChild = optimize(child);
Function childFunction = optimizedChild.getFunctionCall();
if (childFunction.getOperator().equals(operator)) {
if (childFunction != null && childFunction.getOperator().equals(operator)) {
Jackie-Jiang marked this conversation as resolved.
Show resolved Hide resolved
newChildren.addAll(childFunction.getOperands());
} else {
newChildren.add(optimizedChild);
Expand Down
Original file line number Diff line number Diff line change
@@ -0,0 +1,108 @@
/**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package org.apache.pinot.core.query.optimizer.filter;

import java.util.List;
import javax.annotation.Nullable;
import org.apache.pinot.common.request.Expression;
import org.apache.pinot.common.request.Function;
import org.apache.pinot.spi.data.Schema;
import org.apache.pinot.sql.FilterKind;


/**
* This optimizer converts all predicates where the left hand side == right hand side to
* a simple TRUE/FALSE literal value. While filters like, WHERE 1=1 OR "col1"="col1" are not
* typical, they end up expensive in Pinot because they are rewritten as A-A==0.
*/
public class IdenticalPredicateFilterOptimizer extends BaseAndOrBooleanFilterOptimizer {

@Override
boolean canBeOptimized(Expression filterExpression, @Nullable Schema schema) {
// if there's no function call, there's no lhs or rhs
return filterExpression.getFunctionCall() != null;
}

@Override
Expression optimizeChild(Expression filterExpression, @Nullable Schema schema) {
Function function = filterExpression.getFunctionCall();
FilterKind kind = FilterKind.valueOf(function.getOperator());
switch (kind) {
case EQUALS:
if (hasIdenticalLhsAndRhs(filterExpression)) {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

(minor) Directly pass the operands

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

ty, no need to recompute it all

setExpressionToBoolean(filterExpression, true);
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Directly return TRUE, same for the following

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

yup, even better

}
break;
case NOT_EQUALS:
if (hasIdenticalLhsAndRhs(filterExpression)) {
setExpressionToBoolean(filterExpression, false);
}
break;
default:
break;
}
return filterExpression;
}

/**
* Pinot queries of the WHERE 1 != 1 AND "col1" = "col2" variety are rewritten as
* 1-1 != 0 AND "col1"-"col2" = 0. Therefore, we check specifically for the case where
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The rewrite is already happening in PredicateComparisonRewriter.updateFunctionExpression(), so we might just compare the lhs and rhs there.

Since we already get this implementation, we can add a TODO here and revisit later

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I didn't see that class until now. But even then, I think I slightly prefer this more as an optimization than a rewrite. But it's probably easier to do there before it gets converted just for us to convert it back.

* the operand is set up in this fashion.
*
* We return false specifically after every check to ensure we're only continuing when
* the input looks as expected. Otherwise, it's easy to for one of the operand functions
* to return null and fail the query.
*/
private boolean hasIdenticalLhsAndRhs(Expression operand) {
Function function = operand.getFunctionCall();
if (function == null) {
return false;
}
List<Expression> children = function.getOperands();
boolean hasTwoChildren = children.size() == 2;
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

(minor) Is there any case EQ or NEQ can have other than 2 children? We can probably make a precondition

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

a precondition would fail the query, no? even if it is possible, this function is really only supposed to optimize this one case.

Expression firstChild = children.get(0);
if (firstChild.getFunctionCall() == null || !hasTwoChildren) {
return false;
}
boolean firstChildIsMinusOperator = firstChild.getFunctionCall().getOperator().equals("minus");
if (!firstChildIsMinusOperator) {
return false;
}
boolean firstChildHasTwoOperands = firstChild.getFunctionCall().getOperandsSize() == 2;
if (!firstChildHasTwoOperands) {
return false;
}
Expression minusOperandFirstChild = firstChild.getFunctionCall().getOperands().get(0);
Expression minusOperandSecondChild = firstChild.getFunctionCall().getOperands().get(1);
if (minusOperandFirstChild == null || minusOperandSecondChild == null || !minusOperandFirstChild.equals(
minusOperandSecondChild)) {
return false;
}
Expression secondChild = children.get(1);
return isLiteralZero(secondChild);
}

private boolean isLiteralZero(Expression expression) {
if (!expression.isSetLiteral()) {
return false;
}
Object literalValue = expression.getLiteral().getFieldValue();
return literalValue.equals(0) || literalValue.equals(0L) || literalValue.equals(0d);
}
}
Loading