All Downloads are FREE. Search and download functionalities are using the official Maven repository.

io.trino.sql.planner.iterative.rule.PushDownDereferencesThroughTopN Maven / Gradle / Ivy

There is a newer version: 465
Show newest version
/*
 * Licensed 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 io.trino.sql.planner.iterative.rule;

import com.google.common.collect.HashBiMap;
import com.google.common.collect.ImmutableList;
import io.trino.matching.Capture;
import io.trino.matching.Captures;
import io.trino.matching.Pattern;
import io.trino.sql.ir.Expression;
import io.trino.sql.ir.FieldReference;
import io.trino.sql.ir.Reference;
import io.trino.sql.planner.iterative.Rule;
import io.trino.sql.planner.plan.Assignments;
import io.trino.sql.planner.plan.ProjectNode;
import io.trino.sql.planner.plan.TopNNode;

import java.util.Map;
import java.util.Set;

import static com.google.common.collect.ImmutableMap.toImmutableMap;
import static com.google.common.collect.ImmutableSet.toImmutableSet;
import static io.trino.matching.Capture.newCapture;
import static io.trino.sql.planner.ExpressionNodeInliner.replaceExpression;
import static io.trino.sql.planner.iterative.rule.DereferencePushdown.extractRowSubscripts;
import static io.trino.sql.planner.iterative.rule.DereferencePushdown.getBase;
import static io.trino.sql.planner.plan.Patterns.project;
import static io.trino.sql.planner.plan.Patterns.source;
import static io.trino.sql.planner.plan.Patterns.topN;

/**
 * Transforms:
 * 
 *  Project(D := f1(A.x), E := f2(B.x), G := f3(C))
 *      TopN(orderBy = [B])
 *          Source(A, B, C)
 *  
* to: *
 *  Project(D := f1(symbol), E := f2(B.x), G := f3(C))
 *      TopN(orderBy = [B])
 *          Project(A, B, C, symbol := A.x)
 *              Source(A, B, C)
 * 
*

* Pushes down dereference projections through TopN. Excludes dereferences on symbols in ordering scheme to avoid data * replication, since these symbols cannot be pruned. */ public class PushDownDereferencesThroughTopN implements Rule { private static final Capture CHILD = newCapture(); @Override public Pattern getPattern() { return project() .with(source().matching(topN().capturedAs(CHILD))); } @Override public Result apply(ProjectNode projectNode, Captures captures, Context context) { TopNNode topNNode = captures.get(CHILD); // Extract dereferences from project node assignments for pushdown Set dereferences = extractRowSubscripts(projectNode.getAssignments().getExpressions(), false); // Exclude dereferences on symbols being used in orderBy dereferences = dereferences.stream() .filter(expression -> !topNNode.getOrderingScheme().orderBy().contains(getBase(expression))) .collect(toImmutableSet()); if (dereferences.isEmpty()) { return Result.empty(); } // Create new symbols for dereference expressions Assignments dereferenceAssignments = Assignments.of(dereferences, context.getSymbolAllocator()); // Rewrite project node assignments using new symbols for dereference expressions Map mappings = HashBiMap.create(dereferenceAssignments.getMap()) .inverse() .entrySet().stream() .collect(toImmutableMap(Map.Entry::getKey, entry -> entry.getValue().toSymbolReference())); Assignments newAssignments = projectNode.getAssignments().rewrite(expression -> replaceExpression(expression, mappings)); return Result.ofPlanNode( new ProjectNode( context.getIdAllocator().getNextId(), topNNode.replaceChildren(ImmutableList.of( new ProjectNode( context.getIdAllocator().getNextId(), topNNode.getSource(), Assignments.builder() .putIdentities(topNNode.getSource().getOutputSymbols()) .putAll(dereferenceAssignments) .build()))), newAssignments)); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy