1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
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
|
#!/usr/bin/env tarantool
test = require("sqltester")
test:plan(10)
--!./tcltestrunner.lua
-- 2013-06-14
--
-- The author disclaims copyright to this source code. In place of
-- a legal notice, here is a blessing:
--
-- May you do good and not evil.
-- May you find forgiveness for yourself and forgive others.
-- May you share freely, never taking more than you give.
--
-------------------------------------------------------------------------
-- This file implements regression tests for sql library. The
-- focus of this file is testing that the optimizations that disable
-- ORDER BY clauses work correctly
--
-- ["set","testdir",[["file","dirname",["argv0"]]]]
-- ["source",[["testdir"],"\/tester.tcl"]]
testprefix = "orderby5"
-- Generate test data for a join. Verify that the join gets the
-- correct answer.
--
test:do_execsql_test(
1.1,
[[
CREATE TABLE t1(id INT primary key,a TEXT,b INT,c INT);
CREATE INDEX t1bc ON t1(b,c);
EXPLAIN QUERY PLAN
SELECT DISTINCT a, b, c FROM t1 WHERE a='0';
]], {
-- <1.1>
"~/B-TREE/"
-- </1.1>
})
test:do_execsql_test(
"1.2.1",
[[
EXPLAIN QUERY PLAN
SELECT DISTINCT a, c, b FROM t1 WHERE a='0';
]], {
-- <1.2.1>
"~/B-TREE/"
-- </1.2.1>
})
test:do_execsql_test(
"1.2.2",
[[
EXPLAIN QUERY PLAN
SELECT DISTINCT a, c, b FROM t1 WHERE a='xyz' COLLATE "unicode_ci";
]], {
-- <1.2.2>
"/B-TREE/"
-- </1.2.2>
})
test:do_execsql_test(
"1.2.3",
[[
EXPLAIN QUERY PLAN
SELECT DISTINCT a COLLATE "unicode_ci", c, b FROM t1 WHERE a='xyz';
]], {
-- <1.2.3>
"/B-TREE/"
-- </1.2.3>
})
test:do_execsql_test(
"1.2.4",
[[
EXPLAIN QUERY PLAN
SELECT DISTINCT a COLLATE "unicode_ci", c, b FROM t1 WHERE a='xyz' COLLATE "unicode_ci";
]], {
-- <1.2.4>
"~/B-TREE/"
-- </1.2.4>
})
test:do_execsql_test(
1.3,
[[
EXPLAIN QUERY PLAN
SELECT DISTINCT b, a, c FROM t1 WHERE a='0';
]], {
-- <1.3>
"~/B-TREE/"
-- </1.3>
})
test:do_execsql_test(
1.4,
[[
EXPLAIN QUERY PLAN
SELECT DISTINCT b, c, a FROM t1 WHERE a='0';
]], {
-- <1.4>
"~/B-TREE/"
-- </1.4>
})
test:do_execsql_test(
1.5,
[[
EXPLAIN QUERY PLAN
SELECT DISTINCT c, a, b FROM t1 WHERE a='0';
]], {
-- <1.5>
"~/B-TREE/"
-- </1.5>
})
test:do_execsql_test(
1.6,
[[
EXPLAIN QUERY PLAN
SELECT DISTINCT c, b, a FROM t1 WHERE a='0';
]], {
-- <1.6>
"~/B-TREE/"
-- </1.6>
})
test:do_execsql_test(
1.7,
[[
EXPLAIN QUERY PLAN
SELECT DISTINCT c, b, a FROM t1 WHERE +a=0;
]], {
-- <1.7>
"/B-TREE/"
-- </1.7>
})
-- MUST_WORK_TEST
-- # In some cases, it is faster to do repeated index lookups than it is to
-- # sort. But in other cases, it is faster to sort than to do repeated index
-- # lookups.
-- #
-- do_execsql_test 2.1a {
-- CREATE TABLE t2(a INT,b INT,c INT);
-- CREATE INDEX t2bc ON t2(b,c);
-- ANALYZE;
-- INSERT INTO sql_stat1 VALUES('t1','t1bc','1000000 10 9');
-- INSERT INTO sql_stat1 VALUES('t2','t2bc','100 10 5');
-- ANALYZE sql_master;
-- EXPLAIN QUERY PLAN
-- SELECT * FROM t2 WHERE a=0 ORDER BY a, b, c;
-- } {~/B-TREE/}
-- do_execsql_test 2.1b {
-- EXPLAIN QUERY PLAN
-- SELECT * FROM t1 WHERE likelihood(a=0, 0.05) ORDER BY a, b, c;
-- } {/B-TREE/}
-- do_execsql_test 2.2 {
-- EXPLAIN QUERY PLAN
-- SELECT * FROM t1 WHERE +a=0 ORDER BY a, b, c;
-- } {/B-TREE/}
-- do_execsql_test 2.3 {
-- EXPLAIN QUERY PLAN
-- SELECT * FROM t1 WHERE a=0 ORDER BY b, a, c;
-- } {~/B-TREE/}
-- do_execsql_test 2.4 {
-- EXPLAIN QUERY PLAN
-- SELECT * FROM t1 WHERE a=0 ORDER BY b, c, a;
-- } {~/B-TREE/}
-- do_execsql_test 2.5 {
-- EXPLAIN QUERY PLAN
-- SELECT * FROM t1 WHERE a=0 ORDER BY a, c, b;
-- } {/B-TREE/}
-- do_execsql_test 2.6 {
-- EXPLAIN QUERY PLAN
-- SELECT * FROM t1 WHERE a=0 ORDER BY c, a, b;
-- } {/B-TREE/}
-- do_execsql_test 2.7 {
-- EXPLAIN QUERY PLAN
-- SELECT * FROM t1 WHERE a=0 ORDER BY c, b, a;
-- } {/B-TREE/}
-- MUST_WORK_TEST
-- do_execsql_test 3.1 {
-- DROP TABLE t3;
-- CREATE TABLE t3(a INTEGER PRIMARY KEY, b INT, c INT, d INT, e INT, f INT);
-- CREATE INDEX t3bcde ON t3(b, c, d, e);
-- EXPLAIN QUERY PLAN
-- SELECT a FROM t3 WHERE b=2 AND c=3 ORDER BY d DESC, e DESC, b, c, a DESC;
-- } {~/B-TREE/}
test:finish_test()
|
