Package org.voltdb.plannodes

Examples of org.voltdb.plannodes.NestLoopIndexPlanNode

1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
            assert (table_name != null);
            assert (!table_name.isEmpty());
        }
        // NestLoopIndexNode
        else if (node instanceof NestLoopIndexPlanNode) {
            NestLoopIndexPlanNode cast_node = (NestLoopIndexPlanNode) node;
            assert (cast_node.getInlinePlanNodeCount() == 1);
            IndexScanPlanNode idx_node = cast_node.getInlinePlanNode(PlanNodeType.INDEXSCAN);
            table_name = idx_node.getTargetTableName();
        }
        // AbstractOperationPlanNode
        else if (node instanceof AbstractOperationPlanNode) {
            AbstractOperationPlanNode cast_node = (AbstractOperationPlanNode) node;
            table_name = cast_node.getTargetTableName();
            assert (table_name != null);
            assert (!table_name.isEmpty());
        }

        if (table_name != null) {
View Full Code Here
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
            nljAccessPlan.clearParents();
        }

        AbstractPlanNode retval = null;
        if (nljAccessPlan instanceof IndexScanPlanNode) {
            NestLoopIndexPlanNode nlijNode = new NestLoopIndexPlanNode(m_context, PlanAssembler.getNextPlanNodeId());

            nlijNode.setJoinType(JoinType.INNER);

            IndexScanPlanNode innerNode = (IndexScanPlanNode) nljAccessPlan;

            //
            // Now we have to update the column references used by the inner node
            //
            subPlan.updateOutputColumns(m_db);
            final List<Integer> outputColumns = subPlan.getOutputColumnGUIDs();
            final int offset = outputColumns.size();
            if (innerNode.getPredicate() != null) {
                try {
                    innerNode.setPredicate(ExpressionUtil.clone(innerNode.getPredicate()));
                } catch (Exception e) {
                    e.printStackTrace();
                }
//                System.out.println("Join Tables: ");
//                for (Table t : joinOrder)
//                {
//                  System.out.println("Table Name: " + t.getName());
//                }
                //System.out.println("Node type: " + innerNode.getPlanNodeType() + " offset #: " + offset);
                ExpressionUtil.setAndOffsetColumnIndexes(
                        m_context,
                        innerNode.getPredicate(),
                        offset, joinOrder[0].getTypeName(),
                        outputColumns);
            }

            if (innerNode.getEndExpression() != null) {
                try {
                    innerNode.setEndExpression(ExpressionUtil.clone(innerNode.getEndExpression()));
                } catch (Exception e) {
                    e.printStackTrace();
                }
                ExpressionUtil.setAndOffsetColumnIndexes(
                        m_context, innerNode.getEndExpression(), offset, joinOrder[0].getTypeName(), outputColumns);
            }

            ArrayList<AbstractExpression> searchKeyExpressions = new ArrayList<AbstractExpression>(innerNode.getSearchKeyExpressions());
            innerNode.getSearchKeyExpressions().clear();
            for (int ctr = 0, cnt = searchKeyExpressions.size(); ctr < cnt; ctr++) {
                AbstractExpression expr = null;
                try {
                    expr = ExpressionUtil.clone(searchKeyExpressions.get(ctr));
                } catch (Exception e) {
                    e.printStackTrace();
                    System.exit(-1);
                }
                ExpressionUtil.setColumnIndexes(m_context, expr, outputColumns);
                innerNode.getSearchKeyExpressions().add(expr);
            }

            nlijNode.addInlinePlanNode(nljAccessPlan);

            // combine the tails plan graph with the new head node
            nlijNode.addAndLinkChild(subPlan);

            retval = nlijNode;
        }
        else {
            NestLoopPlanNode nljNode = new NestLoopPlanNode(m_context, PlanAssembler.getNextPlanNodeId());
View Full Code Here
199
200
201
202
203
204
205
206
        nlj = (NestLoopPlanNode) n;
        assertTrue(JoinType.LEFT == nlj.getJoinType());
        assertTrue(nlj.getJoinPredicate() != null);
        n = nlj.getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        NestLoopIndexPlanNode nlij = (NestLoopIndexPlanNode) n;
        assertTrue(JoinType.INNER == nlij.getJoinType());
    }
View Full Code Here
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
    public void testIndexedSelfJoin() {
        AbstractPlanNode.enableVerboseExplainForDebugging();
        IndexScanPlanNode c;
        AbstractPlanNode apn;
        AbstractPlanNode pn;
        NestLoopIndexPlanNode nlij;
        List<AbstractExpression> searchKeys;
        // SELF JOIN using two different indexes on the same table
        // sometimes with a surviving sort ordering that supports GROUP BY and/or ORDER BY.

        apn = compile("select * FROM R2 A, R2 B WHERE A.A = B.A AND B.C > 1 ORDER BY B.C");
        //* for debug */ System.out.println(apn.toExplainPlanString());
        // Some day, the wasteful projection node will not be here to skip.
        pn = apn.getChild(0).getChild(0);
        assertTrue(pn instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) pn;
        assertNull(nlij.getPreJoinPredicate());
        assertNull(nlij.getJoinPredicate());
        assertNull(nlij.getWherePredicate());
        assertEquals(1, nlij.getChildCount());
        c = (IndexScanPlanNode) nlij.getChild(0);
        assertNull(c.getPredicate());
        assertEquals(IndexLookupType.GT, c.getLookupType());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof ConstantValueExpression);
        c = (IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertEquals(IndexLookupType.GTE, c.getLookupType());
        assertNull(c.getPredicate());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof TupleValueExpression);

        apn = compile("select * FROM R2 A, R2 B WHERE A.A = B.A AND B.C > 1 ORDER BY B.A, B.C");
        //* for debug */ System.out.println(apn.toExplainPlanString());
        // Some day, the wasteful projection node will not be here to skip.
        pn = apn.getChild(0).getChild(0);
        assertTrue(pn instanceof OrderByPlanNode);
        pn = pn.getChild(0);
        assertTrue(pn instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) pn;
        assertNull(nlij.getPreJoinPredicate());
        assertNull(nlij.getJoinPredicate());
        assertNull(nlij.getWherePredicate());
        assertEquals(1, nlij.getChildCount());
        c = (IndexScanPlanNode) nlij.getChild(0);
        assertNull(c.getPredicate());
        assertEquals(IndexLookupType.GT, c.getLookupType());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof ConstantValueExpression);
        c = (IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertEquals(IndexLookupType.GTE, c.getLookupType());
        assertNull(c.getPredicate());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof TupleValueExpression);

        apn = compile("select * FROM R2 A, R2 B WHERE A.A = B.A AND B.A > 1 ORDER BY B.A, B.C");
        //* for debug */ System.out.println(apn.toExplainPlanString());
        // Some day, the wasteful projection node will not be here to skip.
        pn = apn.getChild(0).getChild(0);
        assertTrue(pn instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) pn;
        assertNull(nlij.getPreJoinPredicate());
        assertNull(nlij.getJoinPredicate());
        assertNull(nlij.getWherePredicate());
        assertEquals(1, nlij.getChildCount());
        assertTrue(nlij.getChild(0) instanceof IndexScanPlanNode);
        c = (IndexScanPlanNode) nlij.getChild(0);
        assertEquals(IndexLookupType.GT, c.getLookupType());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof ConstantValueExpression);
        c = (IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertEquals(IndexLookupType.GTE, c.getLookupType());
        assertNull(c.getPredicate());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof TupleValueExpression);

        apn = compile("select B.C, MAX(A.C) FROM R2 A, R2 B WHERE A.A = B.A AND B.C > 1 GROUP BY B.C ORDER BY B.C");
        //* for debug */ System.out.println(apn.toExplainPlanString());
        // Some day, the wasteful projection node will not be here to skip.
        pn = apn.getChild(0);
        assertNotNull(AggregatePlanNode.getInlineAggregationNode(pn));
        assertTrue(pn instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) pn;
        assertNull(nlij.getPreJoinPredicate());
        assertNull(nlij.getJoinPredicate());
        assertNull(nlij.getWherePredicate());
        assertEquals(1, nlij.getChildCount());
        c = (IndexScanPlanNode) nlij.getChild(0);
        assertNull(c.getPredicate());
        assertEquals(IndexLookupType.GT, c.getLookupType());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof ConstantValueExpression);
        c = (IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertEquals(IndexLookupType.GTE, c.getLookupType());
        assertNull(c.getPredicate());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof TupleValueExpression);

        apn = compile("select B.C, B.A FROM R2 A, R2 B WHERE A.A = B.A AND B.C > 1 GROUP BY B.A, B.C ORDER BY B.A, B.C");
        //* for debug */ System.out.println(apn.toExplainPlanString());
        // Some day, the wasteful projection node will not be here to skip.
        pn = apn.getChild(0).getChild(0);
        assertTrue(pn instanceof OrderByPlanNode);
        pn = pn.getChild(0);
        assertNotNull(AggregatePlanNode.getInlineAggregationNode(pn));
        assertTrue(pn instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) pn;
        assertNull(nlij.getPreJoinPredicate());
        assertNull(nlij.getJoinPredicate());
        assertNull(nlij.getWherePredicate());
        assertEquals(1, nlij.getChildCount());
        c = (IndexScanPlanNode) nlij.getChild(0);
        assertNull(c.getPredicate());
        assertEquals(IndexLookupType.GT, c.getLookupType());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof ConstantValueExpression);
        c = (IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertEquals(IndexLookupType.GTE, c.getLookupType());
        assertNull(c.getPredicate());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof TupleValueExpression);

        apn = compile("select B.C, B.A FROM R2 A, R2 B WHERE A.A = B.A AND B.A > 1 GROUP BY B.A, B.C ORDER BY B.A, B.C");
        //* for debug */ System.out.println(apn.toExplainPlanString());
        // Some day, the wasteful projection node will not be here to skip.
        pn = apn.getChild(0);
        assertNotNull(AggregatePlanNode.getInlineAggregationNode(pn));
        assertTrue(pn instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) pn;
        assertNull(nlij.getPreJoinPredicate());
        assertNull(nlij.getJoinPredicate());
        assertNull(nlij.getWherePredicate());
        assertEquals(1, nlij.getChildCount());
        assertTrue(nlij.getChild(0) instanceof IndexScanPlanNode);
        c = (IndexScanPlanNode) nlij.getChild(0);
        assertEquals(IndexLookupType.GT, c.getLookupType());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof ConstantValueExpression);
        c = (IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertEquals(IndexLookupType.GTE, c.getLookupType());
        assertNull(c.getPredicate());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof TupleValueExpression);

        // Here's a case that can't be optimized because it purposely uses the "wrong" alias
        // in the GROUP BY and ORDER BY.
        apn = compile("select B.C, B.A FROM R2 A, R2 B WHERE A.A = B.A AND B.C > 1 GROUP BY B.A, A.C ORDER BY B.A, A.C");
        //* for debug */ System.out.println(apn.toExplainPlanString());
        // Some day, the wasteful projection node will not be here to skip.
        pn = apn.getChild(0).getChild(0);
        assertTrue(pn instanceof OrderByPlanNode);
        pn = pn.getChild(0);
        assertNotNull(AggregatePlanNode.getInlineAggregationNode(pn));
        assertTrue(pn instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) pn;
        assertNull(nlij.getPreJoinPredicate());
        assertNull(nlij.getJoinPredicate());
        assertNull(nlij.getWherePredicate());
        assertEquals(1, nlij.getChildCount());
        c = (IndexScanPlanNode) nlij.getChild(0);
        assertNull(c.getPredicate());
        assertEquals(IndexLookupType.GT, c.getLookupType());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof ConstantValueExpression);
        c = (IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertEquals(IndexLookupType.GTE, c.getLookupType());
        assertNull(c.getPredicate());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof TupleValueExpression);

        // This variant shows that the GROUP BY can be a permutation of the sort order
        // without messing up the optimization
        apn = compile("select B.C, B.A FROM R2 A, R2 B WHERE A.A = B.A AND B.A > 1 GROUP BY B.C, B.A ORDER BY B.A, B.C");
        //* for debug */ System.out.println(apn.toExplainPlanString());
        // Some day, the wasteful projection node will not be here to skip.
        pn = apn.getChild(0);
        assertNotNull(AggregatePlanNode.getInlineAggregationNode(pn));
        assertTrue(pn instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) pn;
        assertNull(nlij.getPreJoinPredicate());
        assertNull(nlij.getJoinPredicate());
        assertNull(nlij.getWherePredicate());
        assertEquals(1, nlij.getChildCount());
        assertTrue(nlij.getChild(0) instanceof IndexScanPlanNode);
        c = (IndexScanPlanNode) nlij.getChild(0);
        assertEquals(IndexLookupType.GT, c.getLookupType());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof ConstantValueExpression);
        c = (IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertEquals(IndexLookupType.GTE, c.getLookupType());
        assertNull(c.getPredicate());
        searchKeys = c.getSearchKeyExpressions();
        assertEquals(1, searchKeys.size());
        assertTrue(searchKeys.get(0) instanceof TupleValueExpression);
View Full Code Here
537
538
539
540
541
542
543
544
545
546
547
548
549
550
        assertEquals(ExpressionType.VALUE_TUPLE, p.getRight().getExpressionType());
        seqScan = n.getChild(1);
        assertTrue(seqScan instanceof SeqScanPlanNode);
        n = n.getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        NestLoopIndexPlanNode nlij = (NestLoopIndexPlanNode) n;
        indexScan = (IndexScanPlanNode)nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertEquals(IndexLookupType.EQ, indexScan.getLookupType());
        assertEquals(ExpressionType.COMPARE_EQUAL, indexScan.getEndExpression().getExpressionType());
        seqScan = nlij.getChild(0);
        assertTrue(seqScan instanceof SeqScanPlanNode);
        assertEquals(ExpressionType.COMPARE_GREATERTHANOREQUALTO, ((SeqScanPlanNode)seqScan).getPredicate().getExpressionType());

    }
View Full Code Here
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
    }

    public void testIndexInnerJoin() {
        AbstractPlanNode pn;
        AbstractPlanNode n;
        NestLoopIndexPlanNode nli;
        AbstractPlanNode c0;
        pn = compile("select * FROM R3 JOIN R1 ON R1.C = R3.A");
        n = pn.getChild(0).getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        assertTrue(n.getChild(0) instanceof SeqScanPlanNode);
        assertNotNull(n.getInlinePlanNode(PlanNodeType.INDEXSCAN));

        // Test ORDER BY optimization on indexed self-join, ordering by LHS
        pn = compile("select X.A FROM R5 X, R5 Y WHERE X.A = Y.A ORDER BY X.A");
        n = pn.getChild(0);
        assertTrue(n instanceof ProjectionPlanNode);
        n = n.getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        nli = (NestLoopIndexPlanNode) n;
        assertEquals(1, nli.getChildCount());
        c0 = nli.getChild(0);
        assertTrue(c0 instanceof IndexScanPlanNode);
        assertTrue(((IndexScanPlanNode) c0).getTargetTableAlias().equalsIgnoreCase("X"));

        // Test ORDER BY optimization on indexed self-join, ordering by RHS
        pn = compile("select X.A FROM R5 X, R5 Y WHERE X.A = Y.A ORDER BY Y.A");
        n = pn.getChild(0);
        assertTrue(n instanceof ProjectionPlanNode);
        n = n.getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        nli = (NestLoopIndexPlanNode) n;
        assertEquals(1, nli.getChildCount());
        c0 = nli.getChild(0);
        assertTrue(c0 instanceof IndexScanPlanNode);
        assertTrue(((IndexScanPlanNode) c0).getTargetTableAlias().equalsIgnoreCase("Y"));

        // Test safety guarding misapplication of ORDER BY optimization on indexed self-join,
        // when ordering by combination of LHS and RHS columns.
View Full Code Here
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
       // Test multi column condition on index columns
        pn = compile("select A FROM R2 JOIN R3 USING(A)");
        n = pn.getChild(0).getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        NestLoopIndexPlanNode nlij = (NestLoopIndexPlanNode) n;
        assertEquals(IndexLookupType.EQ, ((IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN)).getLookupType());

        pn = compile("select R3.A, R2.A FROM R2 JOIN R3 ON R3.A = R2.A");
        n = pn.getChild(0).getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) n;
        pred = ((IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN)).getPredicate();
        assertEquals(IndexLookupType.EQ, ((IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN)).getLookupType());

        pn = compile("select A, C FROM R3 JOIN R2 USING(A, C)");
        n = pn.getChild(0).getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) n;
        pred = ((IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN)).getPredicate();
        assertNotNull(pred);
        assertEquals(ExpressionType.COMPARE_EQUAL, pred.getExpressionType());

        pn = compile("select R3.A, R2.A FROM R3 JOIN R2 ON R3.A = R2.A AND R3.C = R2.C");
        n = pn.getChild(0).getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        nlij = (NestLoopIndexPlanNode) n;
        pred = ((IndexScanPlanNode) nlij.getInlinePlanNode(PlanNodeType.INDEXSCAN)).getPredicate();
        assertNotNull(pred);
        assertEquals(ExpressionType.COMPARE_EQUAL, pred.getExpressionType());
}
View Full Code Here
839
840
841
842
843
844
845
846
        assertNull(indexScan.getPredicate());

        pn = compile("select * FROM R2 LEFT JOIN R3 ON R3.A = R2.C WHERE R3.A > 3");
        n = pn.getChild(0).getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        NestLoopIndexPlanNode nli = (NestLoopIndexPlanNode) n;
        assertEquals(JoinType.INNER, nli.getJoinType());
   }
View Full Code Here
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
        assertTrue(((SeqScanPlanNode) c1).getTargetTableName().equalsIgnoreCase("R2"));

        pn = compile("select * FROM R2 LEFT JOIN R3 ON R2.C = R3.A");
        n = pn.getChild(0).getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        NestLoopIndexPlanNode nli = (NestLoopIndexPlanNode) n;
        assertEquals(JoinType.LEFT, nli.getJoinType());
        assertEquals(1, nli.getChildCount());
        c0 = nli.getChild(0);
        assertTrue(c0 instanceof SeqScanPlanNode);
        assertTrue(((SeqScanPlanNode) c0).getTargetTableName().equalsIgnoreCase("R2"));
        c1 = nli.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertNotNull(c1);
        assertTrue(((IndexScanPlanNode) c1).getTargetTableName().equalsIgnoreCase("R3"));
      }
View Full Code Here
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
        // R3.C > 0 Inner Join Expr is pushed down to the inlined IndexScan node as a predicate
        // R2.A < 6 Outer Join Expr is a pre-join predicate for NLIJ
        AbstractPlanNode pn = compile("select * FROM R2 LEFT JOIN R3 ON R3.A = R2.A AND R3.C > 0 AND R2.A < 6");
        AbstractPlanNode n = pn.getChild(0).getChild(0);
        assertTrue(n instanceof NestLoopIndexPlanNode);
        NestLoopIndexPlanNode nlij = (NestLoopIndexPlanNode) n;
        assertEquals(JoinType.LEFT, nlij.getJoinType());
        assertNotNull(nlij.getPreJoinPredicate());
        AbstractExpression p = nlij.getPreJoinPredicate();
        assertEquals(ExpressionType.COMPARE_LESSTHAN, p.getExpressionType());
        assertNull(nlij.getJoinPredicate());
        assertNull(nlij.getWherePredicate());
        IndexScanPlanNode indexScan = (IndexScanPlanNode)n.getInlinePlanNode(PlanNodeType.INDEXSCAN);
        assertEquals(IndexLookupType.EQ, indexScan.getLookupType());
        assertEquals(ExpressionType.COMPARE_EQUAL, indexScan.getEndExpression().getExpressionType());
        assertEquals(ExpressionType.COMPARE_GREATERTHAN, indexScan.getPredicate().getExpressionType());
        AbstractPlanNode c1 = n.getChild(0);
View Full Code Here
TOP

Related Classes of org.voltdb.plannodes.NestLoopIndexPlanNode

  • edu.brown.catalog.CatalogUtil
  • org.voltdb.expressions.TupleValueExpression
  • org.voltdb.planner.SelectSubPlanAssembler
  • org.voltdb.planner.SubPlanAssembler
  • org.voltdb.planner.TestMultipleOuterJoinPlans
  • org.voltdb.planner.TestPlansJoin
  • org.voltdb.planner.TestSelfJoins
    • Copyright © 2018 www.massapicom. 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.