com.hazelcast.org.apache.calcite.rel.core.Window Maven / Gradle / Ivy
/*
* 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 com.hazelcast.org.apache.calcite.rel.core;
import com.hazelcast.org.apache.calcite.linq4j.Ord;
import com.hazelcast.org.apache.calcite.plan.RelOptCluster;
import com.hazelcast.org.apache.calcite.plan.RelOptCost;
import com.hazelcast.org.apache.calcite.plan.RelOptPlanner;
import com.hazelcast.org.apache.calcite.plan.RelTraitSet;
import com.hazelcast.org.apache.calcite.rel.RelCollation;
import com.hazelcast.org.apache.calcite.rel.RelCollations;
import com.hazelcast.org.apache.calcite.rel.RelFieldCollation;
import com.hazelcast.org.apache.calcite.rel.RelNode;
import com.hazelcast.org.apache.calcite.rel.RelWriter;
import com.hazelcast.org.apache.calcite.rel.SingleRel;
import com.hazelcast.org.apache.calcite.rel.hint.Hintable;
import com.hazelcast.org.apache.calcite.rel.hint.RelHint;
import com.hazelcast.org.apache.calcite.rel.metadata.RelMetadataQuery;
import com.hazelcast.org.apache.calcite.rel.type.RelDataType;
import com.hazelcast.org.apache.calcite.rex.RexCall;
import com.hazelcast.org.apache.calcite.rex.RexChecker;
import com.hazelcast.org.apache.calcite.rex.RexFieldCollation;
import com.hazelcast.org.apache.calcite.rex.RexLiteral;
import com.hazelcast.org.apache.calcite.rex.RexLocalRef;
import com.hazelcast.org.apache.calcite.rex.RexNode;
import com.hazelcast.org.apache.calcite.rex.RexSlot;
import com.hazelcast.org.apache.calcite.rex.RexWindowBound;
import com.hazelcast.org.apache.calcite.sql.SqlAggFunction;
import com.hazelcast.org.apache.calcite.util.ImmutableBitSet;
import com.hazelcast.org.apache.calcite.util.ImmutableIntList;
import com.hazelcast.org.apache.calcite.util.Litmus;
import com.hazelcast.org.apache.calcite.util.Util;
import com.hazelcast.com.google.common.collect.ImmutableList;
import com.hazelcast.org.checkerframework.checker.initialization.qual.UnderInitialization;
import com.hazelcast.org.checkerframework.checker.nullness.qual.Nullable;
import com.hazelcast.org.checkerframework.checker.nullness.qual.RequiresNonNull;
import java.util.AbstractList;
import java.util.Collections;
import java.util.List;
import java.util.Objects;
/**
* A relational expression representing a set of window aggregates.
*
* A Window can handle several window aggregate functions, over several
* partitions, with pre- and post-expressions, and an optional post-filter.
* Each of the partitions is defined by a partition key (zero or more columns)
* and a range (logical or physical). The partitions expect the data to be
* sorted correctly on input to the relational expression.
*
*
Each {@link Window.Group} has a set of
* {@link com.hazelcast.org.apache.calcite.rex.RexOver} objects.
*
*
Created by {@link com.hazelcast.org.apache.calcite.rel.rules.ProjectToWindowRule}.
*/
public abstract class Window extends SingleRel implements Hintable {
public final ImmutableList groups;
public final ImmutableList constants;
protected final ImmutableList hints;
/**
* Creates a window relational expression.
*
* @param cluster Cluster
* @param traitSet Trait set
* @param hints Hints for this node
* @param input Input relational expression
* @param constants List of constants that are additional inputs
* @param rowType Output row type
* @param groups Windows
*/
protected Window(RelOptCluster cluster, RelTraitSet traitSet, List hints,
RelNode input, List constants, RelDataType rowType, List groups) {
super(cluster, traitSet, input);
this.constants = ImmutableList.copyOf(constants);
assert rowType != null;
this.rowType = rowType;
this.groups = ImmutableList.copyOf(groups);
this.hints = ImmutableList.copyOf(hints);
}
/**
* Creates a window relational expression.
*
* @param cluster Cluster
* @param traitSet Trait set
* @param input Input relational expression
* @param constants List of constants that are additional inputs
* @param rowType Output row type
* @param groups Windows
*/
public Window(RelOptCluster cluster, RelTraitSet traitSet, RelNode input,
List constants, RelDataType rowType, List groups) {
this(cluster, traitSet, Collections.emptyList(), input, constants, rowType, groups);
}
@Override public boolean isValid(Litmus litmus, @Nullable Context context) {
// In the window specifications, an aggregate call such as
// 'SUM(RexInputRef #10)' refers to expression #10 of inputProgram.
// (Not its projections.)
final RelDataType childRowType = getInput().getRowType();
final int childFieldCount = childRowType.getFieldCount();
final int inputSize = childFieldCount + constants.size();
final List inputTypes =
new AbstractList() {
@Override public RelDataType get(int index) {
return index < childFieldCount
? childRowType.getFieldList().get(index).getType()
: constants.get(index - childFieldCount).getType();
}
@Override public int size() {
return inputSize;
}
};
final RexChecker checker = new RexChecker(inputTypes, context, litmus);
int count = 0;
for (Group group : groups) {
for (RexWinAggCall over : group.aggCalls) {
++count;
if (!checker.isValid(over)) {
return litmus.fail(null);
}
}
}
if (count == 0) {
return litmus.fail("empty");
}
return litmus.succeed();
}
@Override public RelWriter explainTerms(RelWriter pw) {
super.explainTerms(pw);
for (Ord window : Ord.zip(groups)) {
pw.item("window#" + window.i, window.e.toString());
}
return pw;
}
public static ImmutableIntList getProjectOrdinals(final List exprs) {
return ImmutableIntList.copyOf(
new AbstractList() {
@Override public Integer get(int index) {
return ((RexSlot) exprs.get(index)).getIndex();
}
@Override public int size() {
return exprs.size();
}
});
}
public static RelCollation getCollation(
final List collations) {
return RelCollations.of(
new AbstractList() {
@Override public RelFieldCollation get(int index) {
final RexFieldCollation collation = collations.get(index);
return new RelFieldCollation(
((RexLocalRef) collation.left).getIndex(),
collation.getDirection(),
collation.getNullDirection());
}
@Override public int size() {
return collations.size();
}
});
}
/**
* Returns constants that are additional inputs of current relation.
* @return constants that are additional inputs of current relation
*/
public List getConstants() {
return constants;
}
@Override public @Nullable RelOptCost computeSelfCost(RelOptPlanner planner,
RelMetadataQuery mq) {
// Cost is proportional to the number of rows and the number of
// components (groups and aggregate functions). There is
// no I/O cost.
//
// TODO #1. Add memory cost.
// TODO #2. MIN and MAX have higher CPU cost than SUM and COUNT.
final double rowsIn = mq.getRowCount(getInput());
int count = groups.size();
for (Group group : groups) {
count += group.aggCalls.size();
}
return planner.getCostFactory().makeCost(rowsIn, rowsIn * count, 0);
}
/**
* Group of windowed aggregate calls that have the same window specification.
*
* The specification is defined by an upper and lower bound, and
* also has zero or more partitioning columns.
*
*
A window is either logical or physical. A physical window is measured
* in terms of row count. A logical window is measured in terms of rows
* within a certain distance from the current sort key.
*
*
For example:
*
*
* ROWS BETWEEN 10 PRECEDING and 5 FOLLOWING is a physical
* window with an upper and lower bound;
* RANGE BETWEEN INTERVAL '1' HOUR PRECEDING AND UNBOUNDED
* FOLLOWING is a logical window with only a lower bound;
* RANGE INTERVAL '10' MINUTES PRECEDING (which is
* equivalent to RANGE BETWEEN INTERVAL '10' MINUTES PRECEDING AND
* CURRENT ROW) is a logical window with an upper and lower bound.
*
*/
public static class Group {
public final ImmutableBitSet keys;
public final boolean isRows;
public final RexWindowBound lowerBound;
public final RexWindowBound upperBound;
public final RelCollation orderKeys;
private final String digest;
/**
* List of {@link Window.RexWinAggCall}
* objects, each of which is a call to a
* {@link com.hazelcast.org.apache.calcite.sql.SqlAggFunction}.
*/
public final ImmutableList aggCalls;
public Group(
ImmutableBitSet keys,
boolean isRows,
RexWindowBound lowerBound,
RexWindowBound upperBound,
RelCollation orderKeys,
List aggCalls) {
this.keys = Objects.requireNonNull(keys, "keys");
this.isRows = isRows;
this.lowerBound = Objects.requireNonNull(lowerBound, "lowerBound");
this.upperBound = Objects.requireNonNull(upperBound, "upperBound");
this.orderKeys = Objects.requireNonNull(orderKeys, "orderKeys");
this.aggCalls = ImmutableList.copyOf(aggCalls);
this.digest = computeString();
}
@Override public String toString() {
return digest;
}
@RequiresNonNull({"keys", "orderKeys", "lowerBound", "upperBound", "aggCalls"})
private String computeString(
@UnderInitialization Group this
) {
final StringBuilder buf = new StringBuilder("window(");
final int i = buf.length();
if (!keys.isEmpty()) {
buf.append("partition ");
buf.append(keys);
}
if (!orderKeys.getFieldCollations().isEmpty()) {
buf.append(buf.length() == i ? "order by " : " order by ");
buf.append(orderKeys);
}
if (orderKeys.getFieldCollations().isEmpty()
&& lowerBound.isUnbounded()
&& lowerBound.isPreceding()
&& upperBound.isUnbounded()
&& upperBound.isFollowing()) {
// skip bracket if no ORDER BY, and if bracket is the default,
// "RANGE BETWEEN UNBOUNDED PRECEDING AND UNBOUNDED FOLLOWING",
// which is equivalent to
// "ROWS BETWEEN UNBOUNDED PRECEDING AND UNBOUNDED FOLLOWING"
} else if (!orderKeys.getFieldCollations().isEmpty()
&& lowerBound.isUnbounded()
&& lowerBound.isPreceding()
&& upperBound.isCurrentRow()
&& !isRows) {
// skip bracket if there is ORDER BY, and if bracket is the default,
// "RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW",
// which is NOT equivalent to
// "ROWS BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW"
} else {
buf.append(isRows ? " rows " : " range ");
buf.append("between ");
buf.append(lowerBound);
buf.append(" and ");
buf.append(upperBound);
}
if (!aggCalls.isEmpty()) {
buf.append(buf.length() == i ? "aggs " : " aggs ");
buf.append(aggCalls);
}
buf.append(")");
return buf.toString();
}
@Override public boolean equals(@Nullable Object obj) {
return this == obj
|| obj instanceof Group
&& this.digest.equals(((Group) obj).digest);
}
@Override public int hashCode() {
return digest.hashCode();
}
public RelCollation collation() {
return orderKeys;
}
/**
* Returns if the window is guaranteed to have rows.
* This is useful to refine data type of window aggregates.
* For instance sum(non-nullable) over (empty window) is NULL.
* @return true when the window is non-empty
* @see com.hazelcast.org.apache.calcite.sql.SqlWindow#isAlwaysNonEmpty()
* @see com.hazelcast.org.apache.calcite.sql.SqlOperatorBinding#getGroupCount()
* @see com.hazelcast.org.apache.calcite.sql.validate.SqlValidatorImpl#resolveWindow(com.hazelcast.org.apache.calcite.sql.SqlNode, com.hazelcast.org.apache.calcite.sql.validate.SqlValidatorScope)
*/
public boolean isAlwaysNonEmpty() {
int lowerKey = lowerBound.getOrderKey();
int upperKey = upperBound.getOrderKey();
return lowerKey > -1 && lowerKey <= upperKey;
}
/**
* Presents a view of the {@link RexWinAggCall} list as a list of
* {@link AggregateCall}.
*/
public List getAggregateCalls(Window windowRel) {
final List fieldNames =
Util.skip(windowRel.getRowType().getFieldNames(),
windowRel.getInput().getRowType().getFieldCount());
return new AbstractList() {
@Override public int size() {
return aggCalls.size();
}
@Override public AggregateCall get(int index) {
final RexWinAggCall aggCall = aggCalls.get(index);
final SqlAggFunction op = (SqlAggFunction) aggCall.getOperator();
return AggregateCall.create(op, aggCall.distinct, false,
aggCall.ignoreNulls, getProjectOrdinals(aggCall.getOperands()),
-1, null, RelCollations.EMPTY,
aggCall.getType(), fieldNames.get(aggCall.ordinal));
}
};
}
}
/**
* A call to a windowed aggregate function.
*
* Belongs to a {@link Window.Group}.
*
*
It's a bastard son of a {@link com.hazelcast.org.apache.calcite.rex.RexCall}; similar
* enough that it gets visited by a {@link com.hazelcast.org.apache.calcite.rex.RexVisitor},
* but it also has some extra data members.
*/
public static class RexWinAggCall extends RexCall {
/**
* Ordinal of this aggregate within its partition.
*/
public final int ordinal;
/** Whether to eliminate duplicates before applying aggregate function. */
public final boolean distinct;
/** Whether to ignore nulls. */
public final boolean ignoreNulls;
@Deprecated // to be removed before 2.0
public RexWinAggCall(
SqlAggFunction aggFun,
RelDataType type,
List operands,
int ordinal,
boolean distinct) {
this(aggFun, type, operands, ordinal, distinct, false);
}
/**
* Creates a RexWinAggCall.
*
* @param aggFun Aggregate function
* @param type Result type
* @param operands Operands to call
* @param ordinal Ordinal within its partition
* @param distinct Eliminate duplicates before applying aggregate function
*/
public RexWinAggCall(
SqlAggFunction aggFun,
RelDataType type,
List operands,
int ordinal,
boolean distinct,
boolean ignoreNulls) {
super(type, aggFun, operands);
this.ordinal = ordinal;
this.distinct = distinct;
this.ignoreNulls = ignoreNulls;
}
@Override public boolean equals(@Nullable Object o) {
if (this == o) {
return true;
}
if (o == null || getClass() != o.getClass()) {
return false;
}
if (!super.equals(o)) {
return false;
}
RexWinAggCall that = (RexWinAggCall) o;
return ordinal == that.ordinal
&& distinct == that.distinct
&& ignoreNulls == that.ignoreNulls;
}
@Override public int hashCode() {
if (hash == 0) {
hash = Objects.hash(super.hashCode(), ordinal, distinct, ignoreNulls);
}
return hash;
}
@Override public RexCall clone(RelDataType type, List operands) {
return super.clone(type, operands);
}
}
@Override public ImmutableList getHints() {
return hints;
}
}