326 lines
9.5 KiB
Plaintext
326 lines
9.5 KiB
Plaintext
# 2010 November 6
|
|
#
|
|
# 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.
|
|
#
|
|
#***********************************************************************
|
|
#
|
|
|
|
set testdir [file dirname $argv0]
|
|
source $testdir/tester.tcl
|
|
|
|
set testprefix eqp
|
|
|
|
#-------------------------------------------------------------------------
|
|
#
|
|
# eqp-1.*: Assorted tests.
|
|
# eqp-2.*: Tests for single select statements.
|
|
# eqp-3.*: Select statements that execute sub-selects.
|
|
# eqp-4.*: Compound select statements.
|
|
#
|
|
|
|
proc do_eqp_test {name sql res} {
|
|
uplevel do_execsql_test $name [list "EXPLAIN QUERY PLAN $sql"] [list $res]
|
|
}
|
|
proc det {args} { uplevel do_eqp_test $args }
|
|
|
|
do_execsql_test 1.1 {
|
|
CREATE TABLE t1(a, b);
|
|
CREATE INDEX i1 ON t1(a);
|
|
CREATE INDEX i2 ON t1(b);
|
|
CREATE TABLE t2(a, b);
|
|
CREATE TABLE t3(a, b);
|
|
}
|
|
|
|
do_eqp_test 1.2 {
|
|
SELECT * FROM t2, t1 WHERE t1.a=1 OR t1.b=2;
|
|
} {
|
|
0 0 1 {SCAN TABLE t1 BY INDEX i1 (a=?) (~10 rows)}
|
|
0 0 1 {SCAN TABLE t1 BY INDEX i2 (b=?) (~10 rows)}
|
|
0 1 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
}
|
|
do_eqp_test 1.3 {
|
|
SELECT * FROM t2 CROSS JOIN t1 WHERE t1.a=1 OR t1.b=2;
|
|
} {
|
|
0 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
0 1 1 {SCAN TABLE t1 BY INDEX i1 (a=?) (~10 rows)}
|
|
0 1 1 {SCAN TABLE t1 BY INDEX i2 (b=?) (~10 rows)}
|
|
}
|
|
do_eqp_test 1.3 {
|
|
SELECT a FROM t1 ORDER BY a
|
|
} {
|
|
0 0 0 {SCAN TABLE t1 BY COVERING INDEX i1 (~1000000 rows)}
|
|
}
|
|
do_eqp_test 1.4 {
|
|
SELECT a FROM t1 ORDER BY +a
|
|
} {
|
|
0 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
0 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
}
|
|
do_eqp_test 1.5 {
|
|
SELECT a FROM t1 WHERE a=4
|
|
} {
|
|
0 0 0 {SCAN TABLE t1 BY COVERING INDEX i1 (a=?) (~10 rows)}
|
|
}
|
|
do_eqp_test 1.6 {
|
|
SELECT DISTINCT count(*) FROM t3 GROUP BY a;
|
|
} {
|
|
0 0 0 {SCAN TABLE t3 (~1000000 rows)}
|
|
0 0 0 {USE TEMP B-TREE FOR GROUP BY}
|
|
0 0 0 {USE TEMP B-TREE FOR DISTINCT}
|
|
}
|
|
|
|
#-------------------------------------------------------------------------
|
|
# Test cases eqp-2.* - tests for single select statements.
|
|
#
|
|
drop_all_tables
|
|
do_execsql_test 2.1 {
|
|
CREATE TABLE t1(x, y);
|
|
|
|
CREATE TABLE t2(x, y);
|
|
CREATE INDEX t2i1 ON t2(x);
|
|
}
|
|
|
|
det 2.2.1 "SELECT DISTINCT min(x), max(x) FROM t1 GROUP BY x ORDER BY 1" {
|
|
0 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
0 0 0 {USE TEMP B-TREE FOR GROUP BY}
|
|
0 0 0 {USE TEMP B-TREE FOR DISTINCT}
|
|
0 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
}
|
|
det 2.2.2 "SELECT DISTINCT min(x), max(x) FROM t2 GROUP BY x ORDER BY 1" {
|
|
0 0 0 {SCAN TABLE t2 BY COVERING INDEX t2i1 (~1000000 rows)}
|
|
0 0 0 {USE TEMP B-TREE FOR DISTINCT}
|
|
0 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
}
|
|
det 2.2.3 "SELECT DISTINCT * FROM t1" {
|
|
0 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
0 0 0 {USE TEMP B-TREE FOR DISTINCT}
|
|
}
|
|
det 2.2.4 "SELECT DISTINCT * FROM t1, t2" {
|
|
0 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
0 1 1 {SCAN TABLE t2 (~1000000 rows)}
|
|
0 0 0 {USE TEMP B-TREE FOR DISTINCT}
|
|
}
|
|
det 2.2.5 "SELECT DISTINCT * FROM t1, t2 ORDER BY t1.x" {
|
|
0 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
0 1 1 {SCAN TABLE t2 (~1000000 rows)}
|
|
0 0 0 {USE TEMP B-TREE FOR DISTINCT}
|
|
0 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
}
|
|
det 2.2.6 "SELECT DISTINCT t2.x FROM t1, t2 ORDER BY t2.x" {
|
|
0 0 1 {SCAN TABLE t2 BY COVERING INDEX t2i1 (~1000000 rows)}
|
|
0 1 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
}
|
|
|
|
det 2.3.1 "SELECT max(x) FROM t2" {
|
|
0 0 0 {SCAN TABLE t2 BY COVERING INDEX t2i1 (~1 rows)}
|
|
}
|
|
det 2.3.2 "SELECT min(x) FROM t2" {
|
|
0 0 0 {SCAN TABLE t2 BY COVERING INDEX t2i1 (~1 rows)}
|
|
}
|
|
det 2.3.3 "SELECT min(x), max(x) FROM t2" {
|
|
0 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
}
|
|
|
|
det 2.4.1 "SELECT * FROM t1 WHERE rowid=?" {
|
|
0 0 0 {SCAN TABLE t1 BY INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
|
|
}
|
|
|
|
|
|
|
|
#-------------------------------------------------------------------------
|
|
# Test cases eqp-3.* - tests for select statements that use sub-selects.
|
|
#
|
|
do_eqp_test 3.1.1 {
|
|
SELECT (SELECT x FROM t1 AS sub) FROM t1;
|
|
} {
|
|
0 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
0 0 0 {EXECUTE SCALAR SUBQUERY 1}
|
|
1 0 0 {SCAN TABLE t1 AS sub (~1000000 rows)}
|
|
}
|
|
do_eqp_test 3.1.2 {
|
|
SELECT * FROM t1 WHERE (SELECT x FROM t1 AS sub);
|
|
} {
|
|
0 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
0 0 0 {EXECUTE SCALAR SUBQUERY 1}
|
|
1 0 0 {SCAN TABLE t1 AS sub (~1000000 rows)}
|
|
}
|
|
do_eqp_test 3.1.3 {
|
|
SELECT * FROM t1 WHERE (SELECT x FROM t1 AS sub ORDER BY y);
|
|
} {
|
|
0 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
0 0 0 {EXECUTE SCALAR SUBQUERY 1}
|
|
1 0 0 {SCAN TABLE t1 AS sub (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
}
|
|
do_eqp_test 3.1.4 {
|
|
SELECT * FROM t1 WHERE (SELECT x FROM t2 ORDER BY x);
|
|
} {
|
|
0 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
0 0 0 {EXECUTE SCALAR SUBQUERY 1}
|
|
1 0 0 {SCAN TABLE t2 BY COVERING INDEX t2i1 (~1000000 rows)}
|
|
}
|
|
|
|
det 3.2.1 {
|
|
SELECT * FROM (SELECT * FROM t1 ORDER BY x LIMIT 10) ORDER BY y LIMIT 5
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
0 0 0 {SCAN SUBQUERY 1 (~1000000 rows)}
|
|
0 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
}
|
|
det 3.2.2 {
|
|
SELECT * FROM
|
|
(SELECT * FROM t1 ORDER BY x LIMIT 10) AS x1,
|
|
(SELECT * FROM t2 ORDER BY x LIMIT 10) AS x2
|
|
ORDER BY x2.y LIMIT 5
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
2 0 0 {SCAN TABLE t2 BY INDEX t2i1 (~1000000 rows)}
|
|
0 0 0 {SCAN SUBQUERY 1 AS x1 (~1000000 rows)}
|
|
0 1 1 {SCAN SUBQUERY 2 AS x2 (~1000000 rows)}
|
|
0 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
}
|
|
|
|
det 3.3.1 {
|
|
SELECT * FROM t1 WHERE y IN (SELECT y FROM t2)
|
|
} {
|
|
0 0 0 {SCAN TABLE t1 (~100000 rows)}
|
|
0 0 0 {EXECUTE LIST SUBQUERY 1}
|
|
1 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
}
|
|
det 3.3.2 {
|
|
SELECT * FROM t1 WHERE y IN (SELECT y FROM t2 WHERE t1.x!=t2.x)
|
|
} {
|
|
0 0 0 {SCAN TABLE t1 (~500000 rows)}
|
|
0 0 0 {EXECUTE CORRELATED LIST SUBQUERY 1}
|
|
1 0 0 {SCAN TABLE t2 (~500000 rows)}
|
|
}
|
|
det 3.3.3 {
|
|
SELECT * FROM t1 WHERE EXISTS (SELECT y FROM t2 WHERE t1.x!=t2.x)
|
|
} {
|
|
0 0 0 {SCAN TABLE t1 (~500000 rows)}
|
|
0 0 0 {EXECUTE CORRELATED SCALAR SUBQUERY 1}
|
|
1 0 0 {SCAN TABLE t2 (~500000 rows)}
|
|
}
|
|
|
|
#-------------------------------------------------------------------------
|
|
# Test cases eqp-4.* - tests for composite select statements.
|
|
#
|
|
do_eqp_test 4.1.1 {
|
|
SELECT * FROM t1 UNION ALL SELECT * FROM t2
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
2 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 2 (UNION ALL)}
|
|
}
|
|
do_eqp_test 4.1.2 {
|
|
SELECT * FROM t1 UNION ALL SELECT * FROM t2 ORDER BY 2
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
2 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
2 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 2 (UNION ALL)}
|
|
}
|
|
do_eqp_test 4.1.3 {
|
|
SELECT * FROM t1 UNION SELECT * FROM t2 ORDER BY 2
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
2 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
2 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 2 (UNION)}
|
|
}
|
|
do_eqp_test 4.1.4 {
|
|
SELECT * FROM t1 INTERSECT SELECT * FROM t2 ORDER BY 2
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
2 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
2 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 2 (INTERSECT)}
|
|
}
|
|
do_eqp_test 4.1.5 {
|
|
SELECT * FROM t1 EXCEPT SELECT * FROM t2 ORDER BY 2
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
2 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
2 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 2 (EXCEPT)}
|
|
}
|
|
|
|
do_eqp_test 4.2.2 {
|
|
SELECT * FROM t1 UNION ALL SELECT * FROM t2 ORDER BY 1
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
2 0 0 {SCAN TABLE t2 BY INDEX t2i1 (~1000000 rows)}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 2 (UNION ALL)}
|
|
}
|
|
do_eqp_test 4.2.3 {
|
|
SELECT * FROM t1 UNION SELECT * FROM t2 ORDER BY 1
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
2 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
2 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 2 (UNION)}
|
|
}
|
|
do_eqp_test 4.2.4 {
|
|
SELECT * FROM t1 INTERSECT SELECT * FROM t2 ORDER BY 1
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
2 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
2 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 2 (INTERSECT)}
|
|
}
|
|
do_eqp_test 4.2.5 {
|
|
SELECT * FROM t1 EXCEPT SELECT * FROM t2 ORDER BY 1
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
1 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
2 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
2 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 2 (EXCEPT)}
|
|
}
|
|
|
|
do_eqp_test 4.3.1 {
|
|
SELECT x FROM t1 UNION SELECT x FROM t2
|
|
} {
|
|
1 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
2 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 2 USING TEMP B-TREE (UNION)}
|
|
}
|
|
|
|
do_eqp_test 4.3.2 {
|
|
SELECT x FROM t1 UNION SELECT x FROM t2 UNION SELECT x FROM t1
|
|
} {
|
|
2 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
3 0 0 {SCAN TABLE t2 (~1000000 rows)}
|
|
1 0 0 {COMPOSITE SUBQUERIES 2 AND 3 USING TEMP B-TREE (UNION)}
|
|
4 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 4 USING TEMP B-TREE (UNION)}
|
|
}
|
|
do_eqp_test 4.3.3 {
|
|
SELECT x FROM t1 UNION SELECT x FROM t2 UNION SELECT x FROM t1 ORDER BY 1
|
|
} {
|
|
2 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
2 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
3 0 0 {SCAN TABLE t2 BY COVERING INDEX t2i1 (~1000000 rows)}
|
|
1 0 0 {COMPOSITE SUBQUERIES 2 AND 3 (UNION)}
|
|
4 0 0 {SCAN TABLE t1 (~1000000 rows)}
|
|
4 0 0 {USE TEMP B-TREE FOR ORDER BY}
|
|
0 0 0 {COMPOSITE SUBQUERIES 1 AND 4 (UNION)}
|
|
}
|
|
|
|
finish_test
|
|
|