Package org.voltdb.plannodes

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

60
61
62
63
64
65
66
67
68
69
70
    public void testCover2ColumnsWithEquality()
    {
        AbstractPlanNode pn = compile("select a from t where a = ? and b = ?;");
        pn = pn.getChild(0);
        if (pn != null) {
            System.out.println(pn.toJSONString());
        }
        assertTrue(pn instanceof IndexScanPlanNode);
        IndexScanPlanNode ispn = (IndexScanPlanNode)pn;
        assertEquals("COVER2_TREE", ispn.getTargetIndexName());
        assertEquals(IndexLookupType.EQ, ispn.getLookupType());
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
    public void testCover3ColumnsInOrderWithLessThan()
    {
        AbstractPlanNode pn = compile("select a from t where a = ? and c = ? and b < ?;");
        pn = pn.getChild(0);
        if (pn != null) {
            System.out.println(pn.toJSONString());
        }
        assertTrue(pn instanceof IndexScanPlanNode);
        IndexScanPlanNode ispn = (IndexScanPlanNode)pn;
        assertEquals("COVER3_TREE", ispn.getTargetIndexName());
        assertEquals(IndexLookupType.LT, ispn.getLookupType());
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
    public void testCover3ColumnsWithLessThanAndOrderBy()
    {
        AbstractPlanNode pn = compile("select a, b from t where a = ? and c = ? and b < ? order by b;");
        pn = pn.getChild(0);
        if (pn != null) {
            System.out.println(pn.toJSONString());
        }
        assertTrue(pn instanceof IndexScanPlanNode);
        IndexScanPlanNode ispn = (IndexScanPlanNode)pn;
        assertEquals("COVER3_TREE", ispn.getTargetIndexName());
        assertEquals(IndexLookupType.GTE, ispn.getLookupType());
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
    public void testCover3ColumnsInOrderWithLessThanAndOrderBy()
    {
        AbstractPlanNode pn = compile("select a, b from t where a = ? and c = ? and b < ? order by b;");
        pn = pn.getChild(0);
        if (pn != null) {
            System.out.println(pn.toJSONString());
        }
        assertTrue(pn instanceof IndexScanPlanNode);
        IndexScanPlanNode ispn = (IndexScanPlanNode)pn;
        assertEquals("COVER3_TREE", ispn.getTargetIndexName());
        assertEquals(IndexLookupType.GTE, ispn.getLookupType());
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
    public void testCover3ColumnsOutOfOrderWithLessThan()
    {
        AbstractPlanNode pn = compile("select a from t where a = ? and b = ? and c < ?;");
        pn = pn.getChild(0);
        if (pn != null) {
            System.out.println(pn.toJSONString());
        }
        assertTrue(pn instanceof IndexScanPlanNode);
        IndexScanPlanNode ispn = (IndexScanPlanNode)pn;
        assertEquals("IDX_1_TREE", ispn.getTargetIndexName());
        assertEquals(IndexLookupType.LT, ispn.getLookupType());
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
    public void testSingleColumnLessThan()
    {
        AbstractPlanNode pn = compile("select a from t where a < ?;");
        pn = pn.getChild(0);
        if (pn != null) {
            System.out.println(pn.toJSONString());
        }
        assertTrue(pn instanceof IndexScanPlanNode);
    }

}
View Full Code Here
121
122
123
124
125
126
127
128
129
130
131
            p = pn.get(0).getChild(0).getChild(0);
            if (p.getPlanNodeType() == PlanNodeType.PROJECTION) {
                p = p.getChild(0);
            }
            assertTrue(p instanceof LimitPlanNode);
            assertTrue(p.toJSONString().contains("\"LIMIT\""));
            checkPushedDownLimit(pn.get(1).getChild(0), downIntoScan, downIntoJoin, isLeftJoin);
        } else {
            p = pn.get(0).getChild(0);
            if (p.getPlanNodeType() == PlanNodeType.PROJECTION) {
                p = p.getChild(0);
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.