Examples of addInlinePlanNode()


Examples of org.voltdb.plannodes.AbstractPlanNode.addInlinePlanNode()

        if ((child instanceof AbstractScanPlanNode) == false)
            return plan;

        plan.clearChildren();
        child.clearParents();
        child.addInlinePlanNode(plan);

        return child;
    }

}
View Full Code Here

Examples of org.voltdb.plannodes.AbstractPlanNode.addInlinePlanNode()

            // OPTIMIZATION: Projection Inline
            // If the root node we got back from createSelectTree() is an
            // AbstractScanNode, then
            // we put the Projection node we just created inside of it
            subSelectRoot.addInlinePlanNode(projectionNode);
            // connect the nodes to build the graph
            deleteNode.addAndLinkChild(subSelectRoot);

            // XXX: PAVLO
            if (INCLUDE_SEND_FOR_ALL) {
View Full Code Here

Examples of org.voltdb.plannodes.AbstractPlanNode.addInlinePlanNode()

            AbstractPlanNode scanNode = sendNode.getChild(0);
            sendNode.unlinkChild(scanNode);

            // link in the delete node
            assert (scanNode instanceof AbstractScanPlanNode);
            scanNode.addInlinePlanNode(projectionNode);
            deleteNode.addAndLinkChild(scanNode);

            AbstractPlanNode combineNode = insertCountInDMLPlan(deleteNode);
            sendNode.addAndLinkChild(combineNode);
View Full Code Here

Examples of org.voltdb.plannodes.AbstractPlanNode.addInlinePlanNode()

        if (m_singlePartition == true) {

            // add the projection inline (TODO: this will break if more than one
            // layer is below this)
            assert(subSelectRoot instanceof AbstractScanPlanNode);
            subSelectRoot.addInlinePlanNode(projectionNode);

            // connect the nodes to build the graph
            updateNode.addAndLinkChild(subSelectRoot);

            // XXX: PAVLO
View Full Code Here

Examples of org.voltdb.plannodes.AbstractPlanNode.addInlinePlanNode()

            AbstractPlanNode scanNode = sendNode.getChild(0);
            sendNode.unlinkChild(scanNode);

            // link in the update node
            assert (scanNode instanceof AbstractScanPlanNode);
            scanNode.addInlinePlanNode(projectionNode);
            updateNode.addAndLinkChild(scanNode);

            AbstractPlanNode countNode = insertCountInDMLPlan(updateNode);
            sendNode.addAndLinkChild(countNode);
View Full Code Here

Examples of org.voltdb.plannodes.AbstractPlanNode.addInlinePlanNode()

                return plan;
            }

            plan.clearChildren();
            child.clearParents();
            child.addInlinePlanNode(plan);
            return child;
        }

        // push down through Projection
        // Replace the chain plan/limit . child/projection . leaf/whatever
View Full Code Here

Examples of org.voltdb.plannodes.AbstractPlanNode.addInlinePlanNode()

            // AbstractScanNode, then
            // we put the Projection node we just created inside of it
            // When we inline this projection into the scan, we're going
            // to overwrite any original projection that we might have inlined
            // in order to simply cull the columns from the persistent table.
            subSelectRoot.addInlinePlanNode(projectionNode);
        }

        if (m_partitioning.wasSpecifiedAsSingle() || m_partitioning.isInferredSingle()) {
            return deleteNode;
        }
View Full Code Here

Examples of org.voltdb.plannodes.AbstractPlanNode.addInlinePlanNode()

        //
        // When we inline this projection into the scan, we're going
        // to overwrite any original projection that we might have inlined
        // in order to simply cull the columns from the persistent table.
        assert(subSelectRoot instanceof AbstractScanPlanNode);
        subSelectRoot.addInlinePlanNode(projectionNode);

        // connect the nodes to build the graph
        updateNode.addAndLinkChild(subSelectRoot);

        if (m_partitioning.wasSpecifiedAsSingle() || m_partitioning.isInferredSingle()) {
View Full Code Here

Examples of org.voltdb.plannodes.AbstractPlanNode.addInlinePlanNode()

            // ensure the order of the data on each partition.
            distributedPlan = handleOrderBy(distributedPlan);

            if (isInlineLimitPlanNodePossible(distributedPlan)) {
                // Inline the distributed limit.
                distributedPlan.addInlinePlanNode(distLimit);
                sendNode.addAndLinkChild(distributedPlan);
            } else {
                distLimit.addAndLinkChild(distributedPlan);
                // Add the distributed work back to the plan
                sendNode.addAndLinkChild(distLimit);
View Full Code Here

Examples of org.voltdb.plannodes.AbstractPlanNode.addInlinePlanNode()

        // Switch if has Complex aggregations
        if (m_parsedSelect.hasComplexAgg()) {
            AbstractPlanNode child = root.getChild(0);
            if (isInlineLimitPlanNodePossible(child)) {
                child.addInlinePlanNode(topLimit);
            } else {
                root.clearChildren();
                child.clearParents();
                topLimit.addAndLinkChild(child);
                root.addAndLinkChild(topLimit);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.