Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/* This file is part of VoltDB.
* Copyright (C) 2008-2018 VoltDB Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with VoltDB. If not, see .
*/
package org.voltdb.planner;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import org.hsqldb_voltpatches.VoltXMLElement;
import org.voltdb.catalog.Database;
import org.voltdb.expressions.AbstractExpression;
import org.voltdb.expressions.ComparisonExpression;
import org.voltdb.expressions.ConjunctionExpression;
import org.voltdb.expressions.ConstantValueExpression;
import org.voltdb.expressions.ParameterValueExpression;
import org.voltdb.expressions.SelectSubqueryExpression;
import org.voltdb.planner.ParsedSelectStmt.LimitOffset;
import org.voltdb.planner.parseinfo.StmtSubqueryScan;
import org.voltdb.planner.parseinfo.StmtTableScan;
import org.voltdb.plannodes.LimitPlanNode;
import org.voltdb.types.ExpressionType;
public class ParsedUnionStmt extends AbstractParsedStmt {
public enum UnionType {
NOUNION,
UNION,
UNION_ALL,
INTERSECT,
INTERSECT_ALL,
EXCEPT_ALL,
EXCEPT
};
// Limit plan node information.
private final LimitOffset m_limitOffset = new LimitOffset();
// Order by
private final List m_orderColumns = new ArrayList<>();
public List m_children = new ArrayList<>();
public UnionType m_unionType = UnionType.NOUNION;
/**
* Class constructor
* @param paramValues
* @param db
*/
public ParsedUnionStmt(AbstractParsedStmt parent, String[] paramValues, Database db) {
super(parent, paramValues, db);
}
@Override
void parse(VoltXMLElement stmtNode) {
String type = stmtNode.attributes.get("uniontype");
// Set operation type
m_unionType = UnionType.valueOf(type);
int idx = 0;
VoltXMLElement limitElement = null, offsetElement = null, orderbyElement = null;
for (VoltXMLElement child : stmtNode.children) {
if (SELECT_NODE_NAME.equals(child.name) ||
UNION_NODE_NAME.equals(child.name)) {
assert(idx < m_children.size());
AbstractParsedStmt nextStmt = m_children.get(idx++);
nextStmt.parse(child);
}
else if (child.name.equals("limit")) {
limitElement = child;
}
else if (child.name.equals("offset")) {
offsetElement = child;
}
else if (child.name.equals("ordercolumns")) {
orderbyElement = child;
}
}
// Parse LIMIT/OFFSET
ParsedSelectStmt.parseLimitAndOffset(limitElement, offsetElement, m_limitOffset);
// Parse ORDER BY
if (orderbyElement != null) {
parseOrderColumns(orderbyElement);
placeTVEsForOrderby();
}
// prepare the limit plan node if it needs one.
if (hasLimitOrOffset()) {
ParsedSelectStmt.prepareLimitPlanNode(this, m_limitOffset);
}
}
/**Parse tables and parameters
*
* @param root
* @param db
*/
@Override
void parseTablesAndParams(VoltXMLElement stmtNode) {
m_tableList.clear();
// Parse parameters first to satisfy a dependency of expression parsing
// which happens during table scan parsing.
parseParameters(stmtNode);
assert(stmtNode.children.size() > 1);
AbstractParsedStmt childStmt = null;
for (VoltXMLElement childSQL : stmtNode.children) {
if (childSQL.name.equals(SELECT_NODE_NAME)) {
childStmt = new ParsedSelectStmt(null, m_paramValues, m_db);
// Assign every child a unique ID
childStmt.setStmtId(AbstractParsedStmt.NEXT_STMT_ID++);
childStmt.m_parentStmt = m_parentStmt;
childStmt.setParentAsUnionClause();
}
else if (childSQL.name.equals(UNION_NODE_NAME)) {
childStmt = new ParsedUnionStmt(null, m_paramValues, m_db);
// Set the parent before recursing to children.
childStmt.m_parentStmt = m_parentStmt;
}
else {
// skip Order By, Limit/Offset. They will be processed later
// by the 'parse' method
continue;
}
childStmt.m_paramsById.putAll(m_paramsById);
childStmt.parseTablesAndParams(childSQL);
promoteUnionParametersFromChild(childStmt);
m_children.add(childStmt);
// Add statement's tables to the consolidated list
m_tableList.addAll(childStmt.m_tableList);
// m_tableAliasListAsJoinOrder is not interesting for UNION
// m_tableAliasMap may have same alias table from different children
addStmtTablesFromChildren(childStmt.getScanEntrySet());
}
}
/**Miscellaneous post parse activity
* .
* @param sql
* @param joinOrder
*/
@Override
void postParse(String sql, String joinOrder) {
for (AbstractParsedStmt selectStmt : m_children) {
selectStmt.postParse(sql, joinOrder);
}
m_sql = sql;
m_joinOrder = joinOrder;
}
@Override
public boolean isOrderDeterministic() {
switch (m_unionType) {
case EXCEPT:
case EXCEPT_ALL:
case INTERSECT:
case INTERSECT_ALL:
// In the back end, these set operators all use boost unordered containers
// to define the output table. We're not sure that iterating over these
// containers will produce deterministic results, so we need to rely on
// the ORDER BY clause on the outermost set operator (if any) to determine
// if order is defined deterministically.
//
// Order by columns always refer to the leftmost select statement.
//
// If the ordering of the left child is deterministically defined by
// order by columns on the outermost set operator, then this is sufficient
// for the whole statement to be order deterministic since both EXCEPT and INTERSECT
// produce results that are subsets of rows produced by the left child of the
// set operator.
return orderIsDeterminedByOrderColumns(m_children.get(0), m_orderColumns);
case UNION:
case UNION_ALL:
if (m_orderColumns.isEmpty()) {
// The outer ORDER BY on a UNION can undo any ordering imposed on the
// children of the union. E.g.,
//
// ((select a, b from t order by a, b)
// union
// (select a, b from r order by a, b)
// ) order by a
//
// The above statement is non-deterministic.
//
// So, only check child-level determinism if there is no outer ORDER BY.
for (int i = 0; i < m_children.size(); ++i) {
if (! m_children.get(i).isOrderDeterministic()) {
return false;
}
}
return true;
}
return orderIsDeterminedByOrderColumns(this, m_orderColumns);
default:
return false;
}
}
private static boolean orderIsDeterminedByOrderColumns(AbstractParsedStmt stmt, List orderColumns) {
if (orderColumns.isEmpty()) {
return false;
}
if (stmt instanceof ParsedSelectStmt) {
ParsedSelectStmt selectStmt = (ParsedSelectStmt) stmt;
ArrayList nonOrdered = new ArrayList<>();
return selectStmt.orderByColumnsDetermineAllDisplayColumns(selectStmt.displayColumns(), orderColumns, nonOrdered);
}
else {
ParsedUnionStmt setOpStmt = (ParsedUnionStmt) stmt;
switch (setOpStmt.m_unionType) {
case EXCEPT:
case EXCEPT_ALL:
case INTERSECT:
case INTERSECT_ALL:
return orderIsDeterminedByOrderColumns(setOpStmt.m_children.get(0), orderColumns);
case UNION:
case UNION_ALL:
// We can return true here if the order by columns
// list all the columns on the select list of the leftmost statement.
// Otherwise, we must return false.
return setOpStmt.getLeftmostSelectStmt().orderByColumnsDetermineAllDisplayColumnsForUnion(orderColumns);
default:
return false;
}
}
}
@Override
public boolean isOrderDeterministicInSpiteOfUnorderedSubqueries() {
// Set OP should not have its own subqueries
return isOrderDeterministic();
}
@Override
public boolean hasLimitOrOffset() {
return m_limitOffset.hasLimitOrOffset();
}
public LimitPlanNode getLimitNodeTop() {
return m_limitOffset.getLimitNodeTop();
}
private void parseOrderColumns(VoltXMLElement columnsNode) {
ParsedSelectStmt leftmostSelectChild = getLeftmostSelectStmt();
for (VoltXMLElement child : columnsNode.children) {
parseOrderColumn(child, leftmostSelectChild);
}
}
private void addStmtTablesFromChildren(Set> entries) {
for (Entry entry : entries) {
String alias = entry.getKey();
StmtTableScan tableScan = entry.getValue();
if (getStmtTableScanByAlias(alias) == null) {
defineTableScanByAlias(alias, tableScan);
} else {
// if there is a duplicate table alias in the map,
// find a new unique name for the key
// the value in the map are more interesting
alias += "_" + System.currentTimeMillis();
HashMap duplicates = new HashMap<>();
duplicates.put(alias, tableScan);
addStmtTablesFromChildren(duplicates.entrySet());
}
}
}
/**
* This is a stripped down version of the ParsedSelectStmt.parseOrderColumn. Since the SET ops
* are not allowed to have aggregate expressions (HAVING, GROUP BY) (except the individual SELECTS)
* all the logic handling the aggregates is omitted here
* @param orderByNode
* @param leftmostSelectChild
*/
private void parseOrderColumn(VoltXMLElement orderByNode, ParsedSelectStmt leftmostSelectChild) {
ParsedColInfo.ExpressionAdjuster adjuster = new ParsedColInfo.ExpressionAdjuster() {
@Override
public AbstractExpression adjust(AbstractExpression expr) {
// Union itself can't have aggregate expression
return expr;
}
};
// Get the display columns from the first child
List displayColumns = leftmostSelectChild.displayColumns();
ParsedColInfo order_col = ParsedColInfo.fromOrderByXml(leftmostSelectChild, orderByNode, adjuster);
AbstractExpression order_exp = order_col.m_expression;
assert(order_exp != null);
// Mark the order by column if it is in displayColumns
// The ORDER BY column MAY be identical to a simple display column, in which case,
// tagging the actual display column as being also an order by column
// helps later when trying to determine ORDER BY coverage (for determinism).
for (ParsedColInfo col : displayColumns) {
if (col.m_alias.equals(order_col.m_alias) || col.m_expression.equals(order_exp)) {
col.m_orderBy = true;
col.m_ascending = order_col.m_ascending;
order_col.m_alias = col.m_alias;
order_col.m_columnName = col.m_columnName;
order_col.m_tableName = col.m_tableName;
break;
}
}
assert( ! (order_exp instanceof ConstantValueExpression));
assert( ! (order_exp instanceof ParameterValueExpression));
m_orderColumns.add(order_col);
}
/**
* Return the leftmost child SELECT statement
* @return ParsedSelectStmt
*/
private ParsedSelectStmt getLeftmostSelectStmt() {
assert (!m_children.isEmpty());
AbstractParsedStmt firstChild = m_children.get(0);
if (firstChild instanceof ParsedSelectStmt) {
return (ParsedSelectStmt) firstChild;
} else {
assert(firstChild instanceof ParsedUnionStmt);
return ((ParsedUnionStmt)firstChild).getLeftmostSelectStmt();
}
}
@Override
public List orderByColumns() {
return Collections.unmodifiableList(m_orderColumns);
}
@Override
public boolean hasOrderByColumns() {
return ! m_orderColumns.isEmpty();
}
/**
* Break up UNION/INTERSECT (ALL) set ops into individual selects that are part
* of the IN/EXISTS subquery into multiple expressions for each set op child
* combined by the conjunction AND/OR expression.
* col IN ( queryA UNION queryB ) - > col IN (queryA) OR col IN (queryB)
* col IN ( queryA INTERSECTS queryB ) - > col IN (queryA) AND col IN (queryB)
* The EXCEPT set op is LEFT as is
* Also the ALL qualifier is dropped because IN/EXISTS expressions only
* need just one tuple in the results set
*
* @param subqueryExpr - IN/EXISTS expression with a possible SET OP subquery
* @return simplified expression
*/
protected static AbstractExpression breakUpSetOpSubquery(AbstractExpression expr) {
assert(expr != null);
SelectSubqueryExpression subqueryExpr = null;
if (expr.getExpressionType() == ExpressionType.COMPARE_EQUAL &&
expr.getRight() instanceof SelectSubqueryExpression) {
subqueryExpr = (SelectSubqueryExpression) expr.getRight();
} else if (expr.getExpressionType() == ExpressionType.OPERATOR_EXISTS &&
expr.getLeft() instanceof SelectSubqueryExpression) {
subqueryExpr = (SelectSubqueryExpression) expr.getLeft();
}
if (subqueryExpr == null) {
return expr;
}
AbstractParsedStmt subquery = subqueryExpr.getSubqueryStmt();
if (!(subquery instanceof ParsedUnionStmt)) {
return expr;
}
ParsedUnionStmt setOpStmt = (ParsedUnionStmt) subquery;
if (UnionType.EXCEPT == setOpStmt.m_unionType || UnionType.EXCEPT_ALL == setOpStmt.m_unionType) {
setOpStmt.m_unionType = UnionType.EXCEPT;
return expr;
}
if (UnionType.UNION_ALL == setOpStmt.m_unionType) {
setOpStmt.m_unionType = UnionType.UNION;
} else if (UnionType.INTERSECT_ALL == setOpStmt.m_unionType) {
setOpStmt.m_unionType = UnionType.INTERSECT;
}
ExpressionType conjuctionType = (setOpStmt.m_unionType == UnionType.UNION) ?
ExpressionType.CONJUNCTION_OR : ExpressionType.CONJUNCTION_AND;
AbstractExpression retval = null;
AbstractParsedStmt parentStmt = subquery.m_parentStmt;
// It's a subquery which means it must have a parent
assert (parentStmt != null);
for (AbstractParsedStmt child : setOpStmt.m_children) {
// add table to the query cache
String withoutAlias = null;
StmtSubqueryScan tableCache = parentStmt.addSubqueryToStmtCache(child, withoutAlias);
AbstractExpression childSubqueryExpr =
new SelectSubqueryExpression(subqueryExpr.getExpressionType(), tableCache);
AbstractExpression newExpr = null;
try {
newExpr = expr.getExpressionType().getExpressionClass().newInstance();
} catch (Exception e) {
e.printStackTrace();
throw new RuntimeException(e.getMessage(), e);
}
newExpr.setExpressionType(expr.getExpressionType());
if (ExpressionType.COMPARE_EQUAL == expr.getExpressionType()) {
newExpr.setLeft(expr.getLeft().clone());
newExpr.setRight(childSubqueryExpr);
assert(newExpr instanceof ComparisonExpression);
((ComparisonExpression)newExpr).setQuantifier(((ComparisonExpression)expr).getQuantifier());
} else {
newExpr.setLeft(childSubqueryExpr);
}
// Recurse
newExpr = ParsedUnionStmt.breakUpSetOpSubquery(newExpr);
if (retval == null) {
retval = newExpr;
} else {
retval = new ConjunctionExpression(conjuctionType, retval, newExpr);
}
}
return retval;
}
private void placeTVEsForOrderby () {
Map displayIndexMap = new HashMap <>();
Map displayIndexToColumnMap = new HashMap <>();
int orderByIndex = 0;
ParsedSelectStmt leftmostSelectChild = getLeftmostSelectStmt();
for (ParsedColInfo col : leftmostSelectChild.m_displayColumns) {
displayIndexMap.put(col.m_expression, orderByIndex);
assert(col.m_alias != null);
displayIndexToColumnMap.put(orderByIndex, col);
orderByIndex++;
}
// place the TVEs from Display columns in the ORDER BY expression
for (ParsedColInfo orderCol : m_orderColumns) {
AbstractExpression expr = orderCol.m_expression.replaceWithTVE(displayIndexMap, displayIndexToColumnMap);
orderCol.m_expression = expr;
}
}
/**
* Here we search all the children, finding if each is content
* deterministic. If it is we return right away.
*/
@Override
public String calculateContentDeterminismMessage() {
String ans = null;
for (AbstractParsedStmt child : m_children) {
ans = child.getContentDeterminismMessage();
if (ans != null) {
return ans;
}
}
return null;
}
@Override
public boolean isDML() { return false; }
@Override
public Collection calculateUDFDependees() {
List answer = new ArrayList<>();
for (AbstractParsedStmt child : m_children) {
Collection chdeps = child.calculateUDFDependees();
if (chdeps != null) {
answer.addAll(chdeps);
}
}
return answer;
}
@Override
protected void parseCommonTableExpressions(VoltXMLElement root) {
// No with statements here.
}
}
