Research on the Performance of MySQL Database Sorting Strategy in High Throughput Environment

In this paper, a database and table sorting strategy based on core stateless fair queue scheduling algorithm is proposed to optimize the response ability and throughput of database clusters. Through the algorithm design, this paper realizes the uniform distribution of data, effectively reduces the single point load, and improves the concurrent processing capability of the whole system. In the simulation environment, this paper simulates the scenario of high concurrent access and carries out stress test on the database cluster. The experimental results show that the system throughput is increased by 32.5% and the response time is reduced by 21.3%, which significantly optimizes the database performance. Specifically, when the number of concurrent users increased from 1000 to 5000, the system throughput increased by only 8% before the policy was adopted, while the throughput increased by 40.2% after the policy was adopted. This result fully proves the superiority of the strategy in high throughput environment. Through the accurate data analysis of the simulation results, this paper finds that the core stateless fair queue scheduling algorithm plays a key role in the process of data distribution. The algorithm not only ensures the uniform distribution of data, but also effectively reduces the delay of data access and improves the overall performance of database cluster.