1# 2011 March 3 2# 3# The author disclaims copyright to this source code. In place of 4# a legal notice, here is a blessing: 5# 6# May you do good and not evil. 7# May you find forgiveness for yourself and forgive others. 8# May you share freely, never taking more than you give. 9# 10#*********************************************************************** 11# 12# This file implements tests for SQLite library. The focus of the tests 13# in this file a corner-case query planner optimization involving the 14# join order of two tables of different sizes. 15# 16 17set testdir [file dirname $argv0] 18source $testdir/tester.tcl 19 20ifcapable !stat4 { 21 finish_test 22 return 23} 24 25set testprefix analyze6 26 27proc eqp {sql {db db}} { 28 uplevel execsql [list "EXPLAIN QUERY PLAN $sql"] $db 29} 30 31do_test analyze6-1.0 { 32 db eval { 33 CREATE TABLE cat(x INT, yz TEXT); 34 CREATE UNIQUE INDEX catx ON cat(x); 35 /* Give cat 16 unique integers */ 36 INSERT INTO cat(x) VALUES(1); 37 INSERT INTO cat(x) VALUES(2); 38 INSERT INTO cat(x) SELECT x+2 FROM cat; 39 INSERT INTO cat(x) SELECT x+4 FROM cat; 40 INSERT INTO cat(x) SELECT x+8 FROM cat; 41 42 CREATE TABLE ev(y INT); 43 CREATE INDEX evy ON ev(y); 44 /* ev will hold 32 copies of 16 integers found in cat */ 45 INSERT INTO ev SELECT x FROM cat; 46 INSERT INTO ev SELECT x FROM cat; 47 INSERT INTO ev SELECT y FROM ev; 48 INSERT INTO ev SELECT y FROM ev; 49 INSERT INTO ev SELECT y FROM ev; 50 INSERT INTO ev SELECT y FROM ev; 51 ANALYZE; 52 SELECT count(*) FROM cat; 53 SELECT count(*) FROM ev; 54 } 55} {16 512} 56 57# The lowest cost plan is to scan CAT and for each integer there, do a single 58# lookup of the first corresponding entry in EV then read off the equal values 59# in EV. (Prior to the 2011-03-04 enhancement to where.c, this query would 60# have used EV for the outer loop instead of CAT - which was about 3x slower.) 61# 62do_test analyze6-1.1 { 63 eqp {SELECT count(*) FROM ev, cat WHERE x=y} 64} {/*SCAN cat USING COVERING INDEX catx*SEARCH ev USING COVERING INDEX evy (y=?)*/} 65 66# The same plan is chosen regardless of the order of the tables in the 67# FROM clause. 68# 69do_eqp_test analyze6-1.2 { 70 SELECT count(*) FROM cat, ev WHERE x=y 71} { 72 QUERY PLAN 73 |--SCAN cat USING COVERING INDEX catx 74 `--SEARCH ev USING COVERING INDEX evy (y=?) 75} 76 77 78# Ticket [83ea97620bd3101645138b7b0e71c12c5498fe3d] 2011-03-30 79# If ANALYZE is run on an empty table, make sure indices are used 80# on the table. 81# 82do_test analyze6-2.1 { 83 execsql { 84 CREATE TABLE t201(x INTEGER PRIMARY KEY, y UNIQUE, z); 85 CREATE INDEX t201z ON t201(z); 86 ANALYZE; 87 } 88 eqp {SELECT * FROM t201 WHERE z=5} 89} {/*SEARCH t201 USING INDEX t201z (z=?)*/} 90do_test analyze6-2.2 { 91 eqp {SELECT * FROM t201 WHERE y=5} 92} {/*SEARCH t201 USING INDEX sqlite_autoindex_t201_1 (y=?)*/} 93do_test analyze6-2.3 { 94 eqp {SELECT * FROM t201 WHERE x=5} 95} {/*SEARCH t201 USING INTEGER PRIMARY KEY (rowid=?)*/} 96do_test analyze6-2.4 { 97 execsql { 98 INSERT INTO t201 VALUES(1,2,3),(2,3,4),(3,4,5); 99 ANALYZE t201; 100 } 101 eqp {SELECT * FROM t201 WHERE z=5} 102} {/*SEARCH t201 USING INDEX t201z (z=?)*/} 103do_test analyze6-2.5 { 104 eqp {SELECT * FROM t201 WHERE y=5} 105} {/*SEARCH t201 USING INDEX sqlite_autoindex_t201_1 (y=?)*/} 106do_test analyze6-2.6 { 107 eqp {SELECT * FROM t201 WHERE x=5} 108} {/*SEARCH t201 USING INTEGER PRIMARY KEY (rowid=?)*/} 109do_test analyze6-2.7 { 110 execsql { 111 INSERT INTO t201 VALUES(4,5,7); 112 INSERT INTO t201 SELECT x+100, y+100, z+100 FROM t201; 113 INSERT INTO t201 SELECT x+200, y+200, z+200 FROM t201; 114 INSERT INTO t201 SELECT x+400, y+400, z+400 FROM t201; 115 ANALYZE t201; 116 } 117 eqp {SELECT * FROM t201 WHERE z=5} 118} {/*SEARCH t201 USING INDEX t201z (z=?)*/} 119do_test analyze6-2.8 { 120 eqp {SELECT * FROM t201 WHERE y=5} 121} {/*SEARCH t201 USING INDEX sqlite_autoindex_t201_1 (y=?)*/} 122do_test analyze6-2.9 { 123 eqp {SELECT * FROM t201 WHERE x=5} 124} {/*SEARCH t201 USING INTEGER PRIMARY KEY (rowid=?)*/} 125 126finish_test 127