mirror of
https://github.com/MariaDB/server.git
synced 2025-02-12 00:15:35 +01:00
![Monty](/assets/img/avatar_default.png)
This includes all test changes from "Changing all cost calculation to be given in milliseconds" and forwards. Some of the things that caused changes in the result files: - As part of fixing tests, I added 'echo' to some comments to be able to easier find out where things where wrong. - MATERIALIZED has now a higher cost compared to X than before. Because of this some MATERIALIZED types have changed to DEPENDEND SUBQUERY. - Some test cases that required MATERIALIZED to repeat a bug was changed by adding more rows to force MATERIALIZED to happen. - 'Filtered' in SHOW EXPLAIN has in many case changed from 100.00 to something smaller. This is because now filtered also takes into account the smallest possible ref access and filters, even if they where not used. Another reason for 'Filtered' being smaller is that we now also take into account implicit filtering done for subqueries using FIRSTMATCH. (main.subselect_no_exists_to_in) This is caluculated in best_access_path() and stored in records_out. - Table orders has changed because more accurate costs. - 'index' and 'ALL' for small tables has changed to use 'range' or 'ref' because of optimizer_scan_setup_cost. - index can be changed to 'range' as 'range' optimizer assumes we don't have to read the blocks from disk that range optimizer has already read. This can be confusing in the case where there is no obvious where clause but instead there is a hidden 'key_column > NULL' added by the optimizer. (main.subselect_no_exists_to_in) - Scan on primary clustered key does not report 'Using Index' anymore (It's a table scan, not an index scan). - For derived tables, the number of rows is now 100 instead of 2, which can be seen in EXPLAIN. - More tests have "Using index for group by" as the cost of this optimization is now more correct (lower). - A primary key could be preferred for a normal key, even if it would access more rows, as it's faster to do 1 lokoup and 3 'index_next' on a clustered primary key than one lookup trough a secondary. (main.stat_tables_innodb) Notes: - There was a 4.7% more calls to best_extension_by_limited_search() in the main.greedy_optimizer test. However examining the test results it looked that the plans where slightly better (eq_ref where more chained together) so I assume this is ok. - I have verified a few test cases where there was notable/unexpected changes in the plan and in all cases the new optimizer plans where faster. (main.greedy_optimizer and some others)
142 lines
6.1 KiB
Text
142 lines
6.1 KiB
Text
create table t1 (i int, i2 char(10), g geometry not null, primary key (i, i2), spatial index (g))engine=innodb;
|
|
insert into t1 values (1, "111", POINT(1,1));
|
|
insert into t1 values (2, "222", POINT(1.5,1.5));
|
|
insert into t1 values (3, "333", POINT(3,3));
|
|
insert into t1 values (4, "444", POINT(3.1,3.1));
|
|
insert into t1 values (5, "555", POINT(5,5));
|
|
analyze table t1;
|
|
Table Op Msg_type Msg_text
|
|
test.t1 analyze status Engine-independent statistics collected
|
|
test.t1 analyze status OK
|
|
set @g1 = ST_GeomFromText('Polygon((0 0,0 3,3 3,3 0,0 0))');
|
|
explain select ST_astext(t1.g) from t1 where MBRWithin(t1.g, @g1);
|
|
id select_type table type possible_keys key key_len ref rows Extra
|
|
1 SIMPLE t1 range g g 34 NULL 5 Using where
|
|
select ST_astext(t1.g) from t1 where MBRWithin(t1.g, @g1);
|
|
ST_astext(t1.g)
|
|
POINT(1.5 1.5)
|
|
POINT(1 1)
|
|
set @g1 = ST_GeomFromText('Polygon((0 0,0 3,3 3,3 0,0 0))');
|
|
delete from t1 where MBRWithin(t1.g, @g1);
|
|
check table t1;
|
|
Table Op Msg_type Msg_text
|
|
test.t1 check status OK
|
|
select ST_astext(t1.g) from t1;
|
|
ST_astext(t1.g)
|
|
POINT(3 3)
|
|
POINT(3.1 3.1)
|
|
POINT(5 5)
|
|
set @g1 = ST_GeomFromText('Polygon((5 5,5 5,5 5,5 5,5 5))');
|
|
update t1 set g = POINT(2,2) where MBRWithin(t1.g, @g1);
|
|
check table t1;
|
|
Table Op Msg_type Msg_text
|
|
test.t1 check status OK
|
|
select ST_astext(t1.g) from t1;
|
|
ST_astext(t1.g)
|
|
POINT(3 3)
|
|
POINT(3.1 3.1)
|
|
POINT(2 2)
|
|
show indexes from t1;
|
|
Table Non_unique Key_name Seq_in_index Column_name Collation Cardinality Sub_part Packed Null Index_type Comment Index_comment Ignored
|
|
t1 0 PRIMARY 1 i A # NULL NULL BTREE NO
|
|
t1 0 PRIMARY 2 i2 A # NULL NULL BTREE NO
|
|
t1 1 g 1 g A # 32 NULL SPATIAL NO
|
|
drop table t1;
|
|
create table t1 (name VARCHAR(100), square GEOMETRY not null, spatial index (square))engine=innodb;
|
|
INSERT INTO t1 VALUES("small", ST_GeomFromText('POLYGON (( 0 0, 0 1, 1 1, 1 0, 0 0))'));
|
|
INSERT INTO t1 VALUES("big", ST_GeomFromText('POLYGON (( 0 0, 0 3, 3 3, 3 0, 0 0))'));
|
|
INSERT INTO t1 VALUES("up", ST_GeomFromText('POLYGON (( 0 1, 0 3, 2 3, 2 1, 0 1))'));
|
|
INSERT INTO t1 VALUES("up2", ST_GeomFromText('POLYGON (( 0 2, 0 4, 2 4, 2 2, 0 2))'));
|
|
INSERT INTO t1 VALUES("up3", ST_GeomFromText('POLYGON (( 0 3, 0 5, 2 5, 2 3, 0 3))'));
|
|
INSERT INTO t1 VALUES("down", ST_GeomFromText('POLYGON (( 0 -1, 0 1, 2 1, 2 -1, 0 -1))'));
|
|
INSERT INTO t1 VALUES("down2", ST_GeomFromText('POLYGON (( 0 -2, 0 0, 2 0, 2 -2, 0 -2))'));
|
|
INSERT INTO t1 VALUES("down3", ST_GeomFromText('POLYGON (( 0 -3, 0 -1, 2 -1, 2 -3, 0 -3))'));
|
|
INSERT INTO t1 VALUES("right", ST_GeomFromText('POLYGON (( 1 0, 1 2, 3 2, 3 0, 1 0))'));
|
|
INSERT INTO t1 VALUES("right2", ST_GeomFromText('POLYGON (( 2 0, 2 2, 4 2, 4 0, 2 0))'));
|
|
INSERT INTO t1 VALUES("right3", ST_GeomFromText('POLYGON (( 3 0, 3 2, 5 2, 5 0, 3 0))'));
|
|
INSERT INTO t1 VALUES("left", ST_GeomFromText('POLYGON (( -1 0, -1 2, 1 2, 1 0, -1 0))'));
|
|
INSERT INTO t1 VALUES("left2", ST_GeomFromText('POLYGON (( -2 0, -2 2, 0 2, 0 0, -2 0))'));
|
|
INSERT INTO t1 VALUES("left3", ST_GeomFromText('POLYGON (( -3 0, -3 2, -1 2, -1 0, -3 0))'));
|
|
SET @p = ST_GeomFromText('POLYGON (( 0 0, 0 2, 2 2, 2 0, 0 0))');
|
|
SELECT name, ST_AsText(square) from t1 where MBRContains(@p, square);
|
|
name ST_AsText(square)
|
|
small POLYGON((0 0,0 1,1 1,1 0,0 0))
|
|
SELECT name, ST_AsText(square) from t1 where MBRDisjoint(@p, square);
|
|
name ST_AsText(square)
|
|
down3 POLYGON((0 -3,0 -1,2 -1,2 -3,0 -3))
|
|
left3 POLYGON((-3 0,-3 2,-1 2,-1 0,-3 0))
|
|
right3 POLYGON((3 0,3 2,5 2,5 0,3 0))
|
|
up3 POLYGON((0 3,0 5,2 5,2 3,0 3))
|
|
SELECT name, ST_AsText(square) from t1 where MBREquals(@p, square);
|
|
name ST_AsText(square)
|
|
SELECT name, ST_AsText(square) from t1 where MBRIntersects(@p, square);
|
|
name ST_AsText(square)
|
|
right2 POLYGON((2 0,2 2,4 2,4 0,2 0))
|
|
right POLYGON((1 0,1 2,3 2,3 0,1 0))
|
|
up2 POLYGON((0 2,0 4,2 4,2 2,0 2))
|
|
up POLYGON((0 1,0 3,2 3,2 1,0 1))
|
|
big POLYGON((0 0,0 3,3 3,3 0,0 0))
|
|
small POLYGON((0 0,0 1,1 1,1 0,0 0))
|
|
down POLYGON((0 -1,0 1,2 1,2 -1,0 -1))
|
|
down2 POLYGON((0 -2,0 0,2 0,2 -2,0 -2))
|
|
left POLYGON((-1 0,-1 2,1 2,1 0,-1 0))
|
|
left2 POLYGON((-2 0,-2 2,0 2,0 0,-2 0))
|
|
SELECT name, ST_AsText(square) from t1 where MBROverlaps(@p, square);
|
|
name ST_AsText(square)
|
|
right POLYGON((1 0,1 2,3 2,3 0,1 0))
|
|
up POLYGON((0 1,0 3,2 3,2 1,0 1))
|
|
down POLYGON((0 -1,0 1,2 1,2 -1,0 -1))
|
|
left POLYGON((-1 0,-1 2,1 2,1 0,-1 0))
|
|
SELECT name, ST_AsText(square) from t1 where MBRTouches(@p, square);
|
|
name ST_AsText(square)
|
|
right2 POLYGON((2 0,2 2,4 2,4 0,2 0))
|
|
up2 POLYGON((0 2,0 4,2 4,2 2,0 2))
|
|
down2 POLYGON((0 -2,0 0,2 0,2 -2,0 -2))
|
|
left2 POLYGON((-2 0,-2 2,0 2,0 0,-2 0))
|
|
SELECT name, ST_AsText(square) from t1 where MBRWithin(@p, square);
|
|
name ST_AsText(square)
|
|
big POLYGON((0 0,0 3,3 3,3 0,0 0))
|
|
SELECT GROUP_CONCAT(a1.name ORDER BY a1.name) AS MBRoverlaps FROM t1 a1 WHERE MBROverlaps(a1.square, @vert1) GROUP BY a1.name;
|
|
MBRoverlaps
|
|
SELECT GROUP_CONCAT(a1.name ORDER BY a1.name) AS MBRoverlaps FROM t1 a1 WHERE MBROverlaps(a1.square, @horiz1) GROUP BY a1.name;
|
|
MBRoverlaps
|
|
SELECT MBROverlaps(@horiz1, @vert1) FROM DUAL;
|
|
MBROverlaps(@horiz1, @vert1)
|
|
NULL
|
|
SELECT MBROverlaps(@horiz1, @horiz2) FROM DUAL;
|
|
MBROverlaps(@horiz1, @horiz2)
|
|
NULL
|
|
SELECT MBROverlaps(@horiz1, @horiz3) FROM DUAL;
|
|
MBROverlaps(@horiz1, @horiz3)
|
|
NULL
|
|
SELECT MBROverlaps(@horiz1, @point1) FROM DUAL;
|
|
MBROverlaps(@horiz1, @point1)
|
|
NULL
|
|
SELECT MBROverlaps(@horiz1, @point2) FROM DUAL;
|
|
MBROverlaps(@horiz1, @point2)
|
|
NULL
|
|
DROP TABLE t1;
|
|
create table t1 (i int not null, g geometry not null)engine=innodb;
|
|
insert into t1 values (1, POINT(1,1));
|
|
insert into t1 values (2, POINT(1.5,1.5));
|
|
insert into t1 values (3, POINT(3,3));
|
|
insert into t1 values (4, POINT(3.1,3.1));
|
|
insert into t1 values (5, POINT(5,5));
|
|
alter table t1 add primary key(i), algorithm=inplace;
|
|
alter table t1 drop primary key;
|
|
create spatial index idx on t1(g) algorithm=inplace;
|
|
create spatial index idx2 on t1(g);
|
|
Warnings:
|
|
Note 1831 Duplicate index `idx2`. This is deprecated and will be disallowed in a future release
|
|
alter table t1 add primary key(i), algorithm=inplace;
|
|
show create table t1;
|
|
Table Create Table
|
|
t1 CREATE TABLE `t1` (
|
|
`i` int(11) NOT NULL,
|
|
`g` geometry NOT NULL,
|
|
PRIMARY KEY (`i`),
|
|
SPATIAL KEY `idx` (`g`),
|
|
SPATIAL KEY `idx2` (`g`)
|
|
) ENGINE=InnoDB DEFAULT CHARSET=latin1 COLLATE=latin1_swedish_ci
|
|
drop index idx on t1;
|
|
drop table t1;
|