Package org.voltdb.plannodes

Examples of org.voltdb.plannodes.AbstractPlanNode

446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
        Procedure catalog_proc = this.getProcedure("JoinProjection");
        Statement catalog_stmt = this.getStatement(catalog_proc, "sql");
        this.check(catalog_stmt);

        // Grab the root node of the multi-partition query plan tree for this Statement
        AbstractPlanNode root = PlanNodeUtil.getRootPlanNodeForStatement(catalog_stmt, false);
        assertNotNull(root);
        //validateNodeColumnOffsets(root);
       
        // Grab the single-partition root node and make sure that they have the same
        // output columns in their topmost send node
        AbstractPlanNode spRoot = PlanNodeUtil.getRootPlanNodeForStatement(catalog_stmt, true);
        assertNotNull(spRoot);
       
        assertEquals(root.getOutputColumnGUIDCount(), spRoot.getOutputColumnGUIDCount());
        PlannerContext context = PlannerContext.singleton();
        assertNotNull(context);
        for (int i = 0, cnt = root.getOutputColumnGUIDCount(); i < cnt; i++) {
            Integer guid0 = root.getOutputColumnGUID(i);
            PlanColumn col0 = context.get(guid0);
            assertNotNull(col0);
           
            Integer guid1 = spRoot.getOutputColumnGUID(i);
            PlanColumn col1 = context.get(guid1);
            assertNotNull(col1);
           
            assertTrue(col0.equals(col1, false, true));
        } // FOR
View Full Code Here
603
604
605
606
607
608
609
610
611
612
613
        Statement catalog_stmt = this.getStatement(catalog_proc, "sql");
        this.check(catalog_stmt);

        // Grab the root node of the multi-partition query plan tree for this
        // Statement
        AbstractPlanNode root = PlanNodeUtil.getRootPlanNodeForStatement(catalog_stmt, false);
        assertNotNull(root);
       
        // We should have two LIMITs and two ORDER BYs
        Class<?> planClasses[] = { LimitPlanNode.class, OrderByPlanNode.class };
        for (Class<?> c : planClasses) {
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
        };
       
        Procedure catalog_proc = this.getProcedure(UpdateLocation.class);
        Statement catalog_stmt = this.getStatement(catalog_proc, "update");

        AbstractPlanNode root = PlanNodeUtil.getRootPlanNodeForStatement(catalog_stmt, true);
        assertNotNull(root);
        Collection<ExpressionType> result = PlanNodeUtil.getScanExpressionTypes(root);
        assertNotNull(result);
        assertFalse(result.isEmpty());
        for (ExpressionType e : expected) {
View Full Code Here
150
151
152
153
154
155
156
157
158
159
160
161
162
163
        Table catalog_tbl = this.getTable(TM1Constants.TABLENAME_CALL_FORWARDING);
        Column expected[] = {
            this.getColumn(catalog_tbl, "S_ID")
        };
       
        AbstractPlanNode root = PlanNodeUtil.getRootPlanNodeForStatement(catalog_stmt, true);
        assertNotNull(root);
       
        Collection<Column> columns = PlanNodeUtil.getOutputColumnsForPlanNode(catalog_db, root.getChild(0));
        assertNotNull(columns);
//        System.err.print(catalog_stmt.fullName() + ": " + CatalogUtil.debug(columns));
//        System.err.println(PlanNodeUtil.debug(root));
        assertEquals(catalog_stmt.fullName(), expected.length, columns.size());
        for (int i = 0; i < expected.length; i++) {
View Full Code Here
176
177
178
179
180
181
182
183
184
185
186
        Table catalog_tbl = this.getTable(TM1Constants.TABLENAME_SUBSCRIBER);
        Column expected[] = {
            this.getColumn(catalog_tbl, "VLR_LOCATION")
        };
       
        AbstractPlanNode root = PlanNodeUtil.getRootPlanNodeForStatement(catalog_stmt, false);
        assertNotNull(root);
        IndexScanPlanNode idx_node = CollectionUtil.first(PlanNodeUtil.getPlanNodes(root, IndexScanPlanNode.class));
        assertNotNull(idx_node);
       
        Collection<Column> columns = PlanNodeUtil.getUpdatedColumnsForPlanNode(catalog_db, idx_node);
View Full Code Here
196
197
198
199
200
201
202
203
204
205
206
207
    /**
     * testGetPlanNodes
     */
    public void testGetPlanNodes() throws Exception {
        PlannerContext cntxt = new PlannerContext();
        AbstractPlanNode root_node = new ProjectionPlanNode(cntxt, 1);
        root_node.addAndLinkChild(new SeqScanPlanNode(cntxt, 2));
       
        Collection<SeqScanPlanNode> found0 = PlanNodeUtil.getPlanNodes(root_node, SeqScanPlanNode.class);
        assertFalse(found0.isEmpty());
       
        Collection<AbstractScanPlanNode> found1 = PlanNodeUtil.getPlanNodes(root_node, AbstractScanPlanNode.class);
View Full Code Here
210
211
212
213
214
215
216
217
218
219
220
221
222
223
   
    /**
     * testGetTableReferences
     */
    public void testGetTableReferences() throws Exception {
        AbstractPlanNode root_node = PlanNodeUtil.getRootPlanNodeForStatement(catalog_stmt, true);
        assertNotNull(root_node);
       
        Collection<AbstractPlanNode> found = PlanNodeUtil.getPlanNodesReferencingTable(root_node, catalog_tbl);
        assertEquals(1, found.size());
        AbstractPlanNode node = CollectionUtil.first(found);
        assertNotNull(node);
        assertTrue(node instanceof AbstractScanPlanNode);
    }
View Full Code Here
234
235
236
237
238
239
240
241
242
243
244
        Set<AbstractPlanNode> all_nodes = new HashSet<AbstractPlanNode>();
       
        for (PlanFragment catalog_frag : fragments) {
            assertNotNull(catalog_frag);
            final Set<AbstractPlanNode> nodes = new HashSet<AbstractPlanNode>();
            AbstractPlanNode root = PlanNodeUtil.getPlanNodeTreeForPlanFragment(catalog_frag);
            assertNotNull(nodes);
            new PlanNodeTreeWalker(true) {
                @Override
                protected void callback(AbstractPlanNode element) {
                    nodes.add(element);
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
    public void testAddTableColumn() throws Exception {
        Procedure catalog_proc = this.getProcedure("SingleProjection");
        Statement catalog_stmt = this.getStatement(catalog_proc, "sql");
       
        // Grab the root node of the multi-partition query plan tree for this Statement
        AbstractPlanNode rootNode = PlanNodeUtil.getRootPlanNodeForStatement(catalog_stmt, false);
        PlanOptimizerUtil.populateTableNodeInfo(state, rootNode);
       
        // check two hashmaps contain what we expect
        checkPlanNodeColumns(state.planNodeColumns);
        checkTableColumns(state.tableColumns);
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
    public void testPopulateTableNodeInfo() throws Exception {
        Procedure catalog_proc = this.getProcedure("SingleProjection");
        Statement catalog_stmt = this.getStatement(catalog_proc, "sql");
       
        // Grab the root node of the multi-partition query plan tree for this Statement
        AbstractPlanNode rootNode = PlanNodeUtil.getRootPlanNodeForStatement(catalog_stmt, false);
        PlanOptimizerUtil.populateTableNodeInfo(state, rootNode);
       
        // check two hashmaps contain what we expect
        checkPlanNodeColumns(state.planNodeColumns);
        checkTableColumns(state.tableColumns);
View Full Code Here
TOP

Related Classes of org.voltdb.plannodes.AbstractPlanNode

  • edu.brown.catalog.CatalogUtil
  • edu.brown.catalog.conflicts.ConflictSetCalculator
  • edu.brown.catalog.TestCatalogUtil
  • edu.brown.designer.MemoryEstimator
  • edu.brown.designer.partitioners.plan.PartitionPlan
  • edu.brown.expressions.TestExpressionUtil
  • edu.brown.gui.catalog.CatalogAttributeText
  • edu.brown.gui.catalog.CatalogTreeModel
  • edu.brown.gui.catalog.PlanTreeCatalogNode$PlanFragmentBoundaries
  • edu.brown.hstore.TestAntiCacheManagerTPCC
    • 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.