Package com.facebook.presto.sql.planner.plan

Examples of com.facebook.presto.sql.planner.plan.TopNNode

568
569
570
571
572
573
574
575
576
577
578
            orderings.put(symbol, toSortOrder(sortItems.next()));
        }

        PlanNode planNode;
        if (limit.isPresent()) {
            planNode = new TopNNode(idAllocator.getNextId(), subPlan.getRoot(), Long.valueOf(limit.get()), orderBySymbols.build(), orderings.build(), false);
        }
        else {
            planNode = new SortNode(idAllocator.getNextId(), subPlan.getRoot(), orderBySymbols.build(), orderings.build());
        }
View Full Code Here
235
236
237
238
239
240
241
                Symbol canonical = canonicalize(symbol);
                symbols.add(canonical);
                orderings.put(canonical, node.getOrderings().get(symbol));
            }

            return new TopNNode(node.getId(), source, node.getCount(), symbols.build(), orderings.build(), node.isPartial(), canonicalize(node.getSampleWeight()));
        }
View Full Code Here
206
207
208
209
210
211
212
213
214
215
216
    @Test
    public void testTopN()
            throws Exception
    {
        PlanNode node = new TopNNode(newId(),
                filter(baseTableScan,
                        and(
                                equals(AE, BE),
                                equals(BE, CE),
                                lessThan(CE, number(10)))),
View Full Code Here
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
            SubPlanBuilder current = node.getSource().accept(this, context);

            // use partial TopN plan if distributed
            boolean partial = current.isDistributed();

            current.setRoot(new TopNNode(node.getId(), current.getRoot(), node.getCount(), node.getOrderBy(), node.getOrderings(), partial, node.getSampleWeight()));

            if (current.isDistributed()) {
                current.setRoot(new SinkNode(idAllocator.getNextId(), current.getRoot(), current.getRoot().getOutputSymbols()));

                // create merge plan fragment
                PlanNode source = new ExchangeNode(idAllocator.getNextId(), current.getId(), current.getRoot().getOutputSymbols());
                TopNNode merge = new TopNNode(idAllocator.getNextId(), source, node.getCount(), node.getOrderBy(), node.getOrderings(), false, node.getSampleWeight());
                current = createSingleNodePlan(merge)
                        .addChild(current.build());
            }

            return current;
View Full Code Here
560
561
562
563
564
565
566
567
568
569
570
            orderings.put(symbol, toSortOrder(sortItems.next()));
        }

        PlanNode planNode;
        if (limit.isPresent()) {
            planNode = new TopNNode(idAllocator.getNextId(), subPlan.getRoot(), Long.valueOf(limit.get()), orderBySymbols.build(), orderings.build(), false, Optional.<Symbol>absent());
        }
        else {
            planNode = new SortNode(idAllocator.getNextId(), subPlan.getRoot(), orderBySymbols.build(), orderings.build());
        }
View Full Code Here
460
461
462
463
464
465
466
467
468
469
470
            orderings.put(symbol, sortItems.next().getOrdering());
        }

        PlanNode planNode;
        if (limit.isPresent()) {
            planNode = new TopNNode(idAllocator.getNextId(), subPlan.getRoot(), Long.valueOf(limit.get()), orderBySymbols.build(), orderings.build(), false);
        }
        else {
            planNode = new SortNode(idAllocator.getNextId(), subPlan.getRoot(), orderBySymbols.build(), orderings.build());
        }
View Full Code Here
218
219
220
221
222
223
224
                Symbol canonical = canonicalize(symbol);
                symbols.add(canonical);
                orderings.put(canonical, node.getOrderings().get(symbol));
            }

            return new TopNNode(node.getId(), source, node.getCount(), symbols.build(), orderings.build(), node.isPartial());
        }
View Full Code Here
84
85
86
87
88
89
90
91
92
        @Override
        public PlanNode rewriteTopN(TopNNode node, Long limit, PlanRewriter<Long> planRewriter)
        {
            PlanNode rewrittenSource = planRewriter.rewrite(node.getSource(), Long.MAX_VALUE);
            if (limit != Long.MAX_VALUE || rewrittenSource != node.getSource()) {
                return new TopNNode(node.getId(), rewrittenSource, Math.min(node.getCount(), limit), node.getOrderBy(), node.getOrderings(), node.isPartial());
            }
            return node;
        }
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
        @Override
        public PlanNode rewriteSort(SortNode node, Long limit, PlanRewriter<Long> planRewriter)
        {
            PlanNode rewrittenSource = planRewriter.rewrite(node.getSource(), Long.MAX_VALUE);
            if (limit != Long.MAX_VALUE) {
                return new TopNNode(node.getId(), rewrittenSource, limit, node.getOrderBy(), node.getOrderings(), false);
            }
            else if (rewrittenSource != node.getSource()) {
                return new SortNode(node.getId(), rewrittenSource, node.getOrderBy(), node.getOrderings());
            }
            return node;
View Full Code Here
274
275
276
277
278
279
280
        {
            Set<Symbol> expectedInputs = ImmutableSet.copyOf(concat(expectedOutputs, node.getOrderBy()));

            PlanNode source = planRewriter.rewrite(node.getSource(), expectedInputs);

            return new TopNNode(node.getId(), source, node.getCount(), node.getOrderBy(), node.getOrderings(), node.isPartial());
        }
View Full Code Here
TOP

Related Classes of com.facebook.presto.sql.planner.plan.TopNNode

  • com.facebook.presto.sql.planner.DistributedLogicalPlanner$Visitor
  • com.facebook.presto.sql.planner.optimizations.LimitPushDown$Rewriter
  • com.facebook.presto.sql.planner.optimizations.MaterializeSamplePullUp$Rewriter
  • com.facebook.presto.sql.planner.optimizations.PruneUnreferencedOutputs$Rewriter
  • com.facebook.presto.sql.planner.optimizations.UnaliasSymbolReferences$Rewriter
  • com.facebook.presto.sql.planner.optimizations.WindowFilterPushDown$Rewriter
  • com.facebook.presto.sql.planner.QueryPlanner
  • com.facebook.presto.sql.planner.TestEffectivePredicateExtractor
    • 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.