Mysql table sharding (1)

In the face of today's big data storage, if the total number of records in a mysql table exceeds 1000, will the performance be greatly reduced? The answer is yes. The total record of a table exceeds 1000 million, and retrieval efficiency is also achieved at the operating system level.

In the face of today's big data storage, if the total number of records in a mysql table exceeds 1000, will the performance be greatly reduced? The answer is yes. The total record of a table exceeds 1000 million, and retrieval efficiency is also achieved at the operating system level.

Conclusion: it can be seen that it takes longer to search by index than to search by index.






Conclusion: we can see that in terms of deletion, there are still a little faster partitions than those without partitions. This demonstrates its ease of Data Management
To facilitate data management, I will use the following example: for example, table t1 in the database records the company's turnover throughout the year (12 months, that is to say, all data files are stored in the same file. If you want to delete the records for the first quarter, you need to scan the entire table to obtain the results. However, if the table t1 is partitioned in advance, I only need to delete the files 1, 2, and 3 respectively. Therefore, to a certain extent, it is easy to manage.

This article is from the "pmghong" blog. Please keep this source