Rechercher dans le manuel MySQL
8.2.4 Optimizing Performance Schema Queries
Applications that monitor databases may make frequent use of
Performance Schema tables. To write queries for these tables
most efficiently, take advantage of their indexes. For example,
include a WHERE
clause that restricts
retrieved rows based on comparison to specific values in an
indexed column.
Most Performance Schema tables have indexes. Tables that do not
are those that normally contain few rows or are unlikely to be
queried frequently. Performance Schema indexes give the
optimizer access to execution plans other than full table scans.
These indexes also improve performance for related objects, such
as sys
schema views that use those
tables.
To see whether a given Performance Schema table has indexes and
what they are, use SHOW INDEX
or
SHOW CREATE TABLE
:
- *************************** 1. row ***************************
- Table: accounts
- Non_unique: 0
- Key_name: ACCOUNT
- Seq_in_index: 1
- Column_name: USER
- Cardinality: NULL
- Sub_part: NULL
- Packed: NULL
- Null: YES
- Index_type: HASH
- Index_comment:
- Visible: YES
- *************************** 2. row ***************************
- Table: accounts
- Non_unique: 0
- Key_name: ACCOUNT
- Seq_in_index: 2
- Column_name: HOST
- Cardinality: NULL
- Sub_part: NULL
- Packed: NULL
- Null: YES
- Index_type: HASH
- Index_comment:
- Visible: YES
- *************************** 1. row ***************************
- Table: rwlock_instances
To see the execution plan for a Performance Schema query and
whether it uses any indexes, use
EXPLAIN
:
The EXPLAIN
output indicates that
the optimizer uses the accounts
table ACCOUNT
index that comprises the
USER
and HOST
columns.
Performance Schema indexes are virtual: They are a construct of the Performance Schema storage engine and use no memory or disk storage. The Performance Schema reports index information to the optimizer so that it can construct efficient execution plans. The Performance Schema in turn uses optimizer information about what to look for (for example, a particular key value), so that it can perform efficient lookups without building actual index structures. This implementation provides two important benefits:
It entirely avoids the maintenance cost normally incurred for tables that undergo frequent updates.
It reduces at an early stage of query execution the amount of data retrieved. For conditions on the indexed columns, the Performance Schema efficiently returns only table rows that satisfy the query conditions. Without an index, the Performance Schema would return all rows in the table, requiring that the optimizer later evaluate the conditions against each row to produce the final result.
Performance Schema indexes are predefined and cannot be dropped, added, or altered.
Performance Schema indexes are similar to hash indexes. For example:
They are used only for equality comparisons that use the
=
or<=>
operators.They are unordered. If a query result must have specific row ordering characteristics, include an
ORDER BY
clause.
For additional information about hash indexes, see Section 8.3.9, “Comparison of B-Tree and Hash Indexes”.
Document created the 26/06/2006, last modified the 26/10/2018
Source of the printed document:https://www.gaudry.be/en/mysql-rf-performance-schema-optimization.html
The infobrol is a personal site whose content is my sole responsibility. The text is available under CreativeCommons license (BY-NC-SA). More info on the terms of use and the author.
References
These references and links indicate documents consulted during the writing of this page, or which may provide additional information, but the authors of these sources can not be held responsible for the content of this page.
The author This site is solely responsible for the way in which the various concepts, and the freedoms that are taken with the reference works, are presented here. Remember that you must cross multiple source information to reduce the risk of errors.