mirror of
https://github.com/MariaDB/server.git
synced 2025-02-07 06:12:18 +01:00
727491b72a
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)
37 lines
1.3 KiB
Text
37 lines
1.3 KiB
Text
DESC sys.schema_redundant_indexes;
|
|
Field Type Null Key Default Extra
|
|
table_schema varchar(64) NO NULL
|
|
table_name varchar(64) NO NULL
|
|
redundant_index_name varchar(64) NO NULL
|
|
redundant_index_columns mediumtext YES NULL
|
|
redundant_index_non_unique bigint(1) YES NULL
|
|
dominant_index_name varchar(64) NO NULL
|
|
dominant_index_columns mediumtext YES NULL
|
|
dominant_index_non_unique bigint(1) YES NULL
|
|
subpart_exists int(1) YES NULL
|
|
sql_drop_index varchar(223) YES NULL
|
|
SELECT * FROM sys.schema_redundant_indexes;
|
|
DESC sys.x$schema_flattened_keys;
|
|
Field Type Null Key Default Extra
|
|
table_schema varchar(64) NO NULL
|
|
table_name varchar(64) NO NULL
|
|
index_name varchar(64) NO NULL
|
|
non_unique bigint(1) YES NULL
|
|
subpart_exists bigint(1) YES NULL
|
|
index_columns mediumtext YES NULL
|
|
SELECT * FROM sys.x$schema_flattened_keys;
|
|
CREATE DATABASE rkey;
|
|
CREATE TABLE rkey.rkey (
|
|
i INT,
|
|
j INT,
|
|
k INT,
|
|
PRIMARY KEY (i),
|
|
KEY (j),
|
|
KEY (j, k),
|
|
KEY (i, j, k)
|
|
);
|
|
SELECT * FROM sys.schema_redundant_indexes;
|
|
table_schema table_name redundant_index_name redundant_index_columns redundant_index_non_unique dominant_index_name dominant_index_columns dominant_index_non_unique subpart_exists sql_drop_index
|
|
rkey rkey i i,j,k 1 PRIMARY i 0 0 ALTER TABLE `rkey`.`rkey` DROP INDEX `i`
|
|
rkey rkey j j 1 j_2 j,k 1 0 ALTER TABLE `rkey`.`rkey` DROP INDEX `j`
|
|
DROP DATABASE rkey;
|