MySQL learning to talk about query statement execution process
If you want to learn MySQL in depth, you should start from the macro architecture. In this article, we will learn the process of executing MySQL query statements. I hope it will be helpful to everyone!
The MySQL version of this article is 8.0.18
Architecture diagram
Parser
The function of the parser is to perform the following work on the SQL statement sent from the client:
- Grammar Parsing: Check the syntax of the SQL statement, whether the brackets and quotation marks are closed, etc.
- Lexical parsing: Split the keywords, table names, and field names in the SQL statement into nodes, and finally obtain a parse tree
Preprocessor
The parser mainly checks the grammar and lexicon, but if the grammar and lexicon are correct, but the table , the field does not exist, then this SQL statement cannot be executed correctly.
So the role of the preprocessor is: Semantic parsing, to determine whether the semantics of the parse tree is correct and whether tables and fields exist. After preprocessing, a new parse tree will be obtained.
Query optimizer
Query optimizer structure
The execution method of a SQL statement in MySQL is as follows Although the same results will be obtained in the end, there are differences in overhead. The specific execution method chosen is determined by the query optimizer. For example:
- There are multiple indexes in the table that can be selected. Which index should be selected?
- When we perform related queries on multiple tables, which table’s data should be used? For the benchmark table
The query optimizer is a cost-based optimizer. Its working principle is to evaluate various execution plans based on the parse tree. The cost required for the execution method, will eventually get an execution plan with the minimum cost as the final solution .
However, this execution method with the smallest overhead is not necessarily the optimal execution method. For example, an index should be used, but a full table scan is performed. Although there are two words "optimization" in the query optimizer, this optimization is not omnipotent. In many cases, it is more necessary to consider whether the SQL statement is written reasonably.
Logical query optimization
Logical query optimization is mainly responsible for performing some relational algebra to optimize SQL statements, thereby making SQL statement execution more efficient
We can use several cases to briefly understand logical query optimization
-
Subquery merging
Before merging
SELECT * FROM t1 WHERE a1<10 AND ( EXISTS(SELECT a2 FROM t2 WHERE t2.a2<5 AND t2.b2=1) OR EXISTS(SELECT a2 FROM t2 WHERE t2.a2<5 AND t2.b2=2) );
After merging
SELECT * FROM t1 WHERE a1<10 AND ( EXISTS(SELECT a2 FROM t2 WHERE t2.a2<5 AND (t2.b2=1 OR t2.b2=2) );
Merge multiple subqueries by merging query conditions, and reduce multiple connection operations to a single table scan and a single connection
-
Equivalent predicate rewriting
Like the familiar like fuzzy query, % is written after the condition before the index range query is performed. In fact, this is the credit of the query optimizer
Assume that the conditions used are all indexed, before rewriting
SELECT * FROM USERINFO WHERE name LIKE 'Abc%';
After rewriting
SELECT * FROM USERINFO WHERE name >= 'Abc' AND name < 'Abd';
This is why the answer to index range query
-
Conditional simplification
Conditional simplification is also used Some equations and algebraic relationships are used to achieve simplification
- Remove redundant brackets in expressions and reduce the levels of AND and OR trees generated during syntax analysis, such as
((a AND b) AND (c AND d))
is simplified toa AND b AND c AND d
- Constant transfer, such as
col1 = col2 AND col2 = 3
is simplified tocol1 = 3 AND col2 = 3
- Expression calculation, some expressions that can be directly solved will be converted into the final calculation result, such as
col1 = 1 2
Simplification Forcol1 = 3
- Remove redundant brackets in expressions and reduce the levels of AND and OR trees generated during syntax analysis, such as
##Physical query optimization
The main work of physical query optimization is based on SQL Statements evaluate the cost of multiple execution plans respectivelyPhysical query optimization mainly solves the following problems:- Which method is the least expensive in single table scanning? (scan index back to table or full table scan)
- When there is a table connection, which connection method is the least expensive to use
Cost evaluation formula | |
---|---|
N_page * a_page_IO_time N_tuple * a_tuple_CPU_time | |
C_index N_page_index * a_page_IO_time |
The above is the detailed content of MySQL learning to talk about query statement execution process. For more information, please follow other related articles on the PHP Chinese website!

Stored procedures are precompiled SQL statements in MySQL for improving performance and simplifying complex operations. 1. Improve performance: After the first compilation, subsequent calls do not need to be recompiled. 2. Improve security: Restrict data table access through permission control. 3. Simplify complex operations: combine multiple SQL statements to simplify application layer logic.

The working principle of MySQL query cache is to store the results of SELECT query, and when the same query is executed again, the cached results are directly returned. 1) Query cache improves database reading performance and finds cached results through hash values. 2) Simple configuration, set query_cache_type and query_cache_size in MySQL configuration file. 3) Use the SQL_NO_CACHE keyword to disable the cache of specific queries. 4) In high-frequency update environments, query cache may cause performance bottlenecks and needs to be optimized for use through monitoring and adjustment of parameters.

The reasons why MySQL is widely used in various projects include: 1. High performance and scalability, supporting multiple storage engines; 2. Easy to use and maintain, simple configuration and rich tools; 3. Rich ecosystem, attracting a large number of community and third-party tool support; 4. Cross-platform support, suitable for multiple operating systems.

The steps for upgrading MySQL database include: 1. Backup the database, 2. Stop the current MySQL service, 3. Install the new version of MySQL, 4. Start the new version of MySQL service, 5. Recover the database. Compatibility issues are required during the upgrade process, and advanced tools such as PerconaToolkit can be used for testing and optimization.

MySQL backup policies include logical backup, physical backup, incremental backup, replication-based backup, and cloud backup. 1. Logical backup uses mysqldump to export database structure and data, which is suitable for small databases and version migrations. 2. Physical backups are fast and comprehensive by copying data files, but require database consistency. 3. Incremental backup uses binary logging to record changes, which is suitable for large databases. 4. Replication-based backup reduces the impact on the production system by backing up from the server. 5. Cloud backups such as AmazonRDS provide automation solutions, but costs and control need to be considered. When selecting a policy, database size, downtime tolerance, recovery time, and recovery point goals should be considered.

MySQLclusteringenhancesdatabaserobustnessandscalabilitybydistributingdataacrossmultiplenodes.ItusestheNDBenginefordatareplicationandfaulttolerance,ensuringhighavailability.Setupinvolvesconfiguringmanagement,data,andSQLnodes,withcarefulmonitoringandpe

Optimizing database schema design in MySQL can improve performance through the following steps: 1. Index optimization: Create indexes on common query columns, balancing the overhead of query and inserting updates. 2. Table structure optimization: Reduce data redundancy through normalization or anti-normalization and improve access efficiency. 3. Data type selection: Use appropriate data types, such as INT instead of VARCHAR, to reduce storage space. 4. Partitioning and sub-table: For large data volumes, use partitioning and sub-table to disperse data to improve query and maintenance efficiency.

TooptimizeMySQLperformance,followthesesteps:1)Implementproperindexingtospeedupqueries,2)UseEXPLAINtoanalyzeandoptimizequeryperformance,3)Adjustserverconfigurationsettingslikeinnodb_buffer_pool_sizeandmax_connections,4)Usepartitioningforlargetablestoi


Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

WebStorm Mac version
Useful JavaScript development tools

Notepad++7.3.1
Easy-to-use and free code editor

DVWA
Damn Vulnerable Web App (DVWA) is a PHP/MySQL web application that is very vulnerable. Its main goals are to be an aid for security professionals to test their skills and tools in a legal environment, to help web developers better understand the process of securing web applications, and to help teachers/students teach/learn in a classroom environment Web application security. The goal of DVWA is to practice some of the most common web vulnerabilities through a simple and straightforward interface, with varying degrees of difficulty. Please note that this software

MinGW - Minimalist GNU for Windows
This project is in the process of being migrated to osdn.net/projects/mingw, you can continue to follow us there. MinGW: A native Windows port of the GNU Compiler Collection (GCC), freely distributable import libraries and header files for building native Windows applications; includes extensions to the MSVC runtime to support C99 functionality. All MinGW software can run on 64-bit Windows platforms.

SublimeText3 Chinese version
Chinese version, very easy to use
