Research And Implementation Of Performance Optimize Stratery Based On Relation Database

With data volume much bigger and data process more complex than before,thedatabase performance is subjected to a bigger challenge.However,during the developprocess of the system,little attention are paid to the performance of the system.After thedatabase throwing into use,as the increasing amount of data, data distribution willproduce larger changes. All of those may cause potential database performance problem.Therefore, how to adjust and optimize database performance has become an importantsubject on database research.In this thesis, the theory of the general relational database performanceoptimization is firstly reaearched and analysed deeply,then an optimization methodnamed based on the level of the iterative is put forward. Based on it, a performancetuning scheme for a particular SQL Server database which have some performanceproblems is proposed. The scheme mainly include three levels of optimization,whichis the index, the SQL statement and the disk storage,each level are put forward theoptimization process and optimization strategy.In the disk storage optimization, an automechanism about partition and fragment cleaning in fixed time is proposed and realized.Finally, the performance of the database before and after the implementation of theoptimized scheme is compared,and the performance of the database has been obviouslyimproved.This shows that use the proposed based on the level of the interativeoptimization method to form database optimization scheme is effective.