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

com.hazelcast.org.apache.calcite.rel.core.RepeatUnion Maven / Gradle / Ivy

There is a newer version: 5.4.0
Show newest version
/*
 * 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 com.hazelcast.com.liance with
 * the License.  You may obtain a copy of the License at
 *
 * http://www.apache.com.hazelcast.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 com.hazelcast.org.apache.calcite.rel.core;

import com.hazelcast.org.apache.calcite.linq4j.function.Experimental;
import com.hazelcast.org.apache.calcite.plan.RelOptCluster;
import com.hazelcast.org.apache.calcite.plan.RelTraitSet;
import com.hazelcast.org.apache.calcite.rel.BiRel;
import com.hazelcast.org.apache.calcite.rel.RelNode;
import com.hazelcast.org.apache.calcite.rel.RelWriter;
import com.hazelcast.org.apache.calcite.rel.metadata.RelMetadataQuery;
import com.hazelcast.org.apache.calcite.rel.type.RelDataType;
import com.hazelcast.org.apache.calcite.util.Util;

import com.hazelcast.com.google.com.hazelcast.com.on.collect.Lists;

import java.util.List;

/**
 * Relational expression that com.hazelcast.com.utes a repeat union (recursive union in SQL
 * terminology).
 *
 * 

This operation is executed as follows: * *

    *
  • Evaluate the left input (i.e., seed relational expression) once. For * UNION (but not UNION ALL), discard duplicated rows. * *
  • Evaluate the right input (i.e., iterative relational expression) over and * over until it produces no more results (or until an optional maximum number * of iterations is reached). For UNION (but not UNION ALL), discard * duplicated results. *
* *

NOTE: The current API is experimental and subject to change without * notice. */ @Experimental public abstract class RepeatUnion extends BiRel { /** * Whether duplicates are considered. */ public final boolean all; /** * Maximum number of times to repeat the iterative relational expression; * negative value means no limit, 0 means only seed will be evaluated */ public final int iterationLimit; //~ Constructors ----------------------------------------------------------- protected RepeatUnion(RelOptCluster cluster, RelTraitSet traitSet, RelNode seed, RelNode iterative, boolean all, int iterationLimit) { super(cluster, traitSet, seed, iterative); this.iterationLimit = iterationLimit; this.all = all; } @Override public double estimateRowCount(RelMetadataQuery mq) { // TODO implement a more accurate row count? double seedRowCount = mq.getRowCount(getSeedRel()); if (iterationLimit == 0) { return seedRowCount; } return seedRowCount + mq.getRowCount(getIterativeRel()) * (iterationLimit < 0 ? 10 : iterationLimit); } @Override public RelWriter explainTerms(RelWriter pw) { super.explainTerms(pw); if (iterationLimit >= 0) { pw.item("iterationLimit", iterationLimit); } return pw.item("all", all); } public RelNode getSeedRel() { return left; } public RelNode getIterativeRel() { return right; } @Override protected RelDataType deriveRowType() { final List inputRowTypes = Lists.transform(getInputs(), RelNode::getRowType); final RelDataType rowType = getCluster().getTypeFactory().leastRestrictive(inputRowTypes); if (rowType == null) { throw new IllegalArgumentException("Cannot com.hazelcast.com.ute com.hazelcast.com.atible row type " + "for arguments: " + Util.sepList(inputRowTypes, ", ")); } return rowType; } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy