SQL Server database Optimization Methods
There are many causes for slow query speed in actual operations by cleverly optimizing the SQL Server database. The most common causes are as follows: no index or no index is used (this is the most common problem of slow query and is a defect in programming ).
Low I/O throughput leads to a bottleneck effect.
The SQL Server database is not optimized because no computing column is created.
Insufficient memory.
Slow network speed.
The queried data volume is too large (you can use multiple queries to reduce the data volume ).
Lock or deadlock (this is also the most common problem of slow query and is a defect in programming ).
Sp_lock, sp_who, viewed by the active user, because it reads and writes competing resources.
Unnecessary rows and columns are returned.
The query statement is not good and is not optimized.
You can optimize the query by using the following methods:
1. Place data, logs, and indexes on different I/O devices to increase the reading speed. In the past, Tempdb can be placed on RAID0, which is not supported by SQL2000. The larger the data size (size), the more important it is to increase I/O.
2. Split the table vertically and horizontally to reduce the table size (sp_spaceuse ).
3. Upgrade the hardware.
4. Create an index based on the query conditions, optimize the index, optimize the SQL Server database access mode, and limit the data volume of the result set. Note that the fill factor should be appropriate (preferably the default value 0 ). The index should be as small as possible. Use a column with a small number of bytes to create an index (refer to the index creation). Do not create a single index for fields with a limited number of values, such as gender fields.
5. Increase the network speed.
6. Expand the server memory. Windows 2000 and SQL Server 2000 support 4-8 GB memory. Configure virtual memory: the virtual memory size should be configured based on services running concurrently on the computer. Run Microsoft SQL server? 2000, you can consider setting the virtual memory size to 1.5 times the physical memory installed on your computer. If you have installed the full-text search feature and intend to run the Microsoft Search Service for full-text indexing and query, consider:
Set the virtual memory size to at least three times the physical memory installed on the computer. Configure the SQL Server Max Server Memory server configuration option to 1.5 times the physical memory (half the virtual memory size ).
7. Increase the number of server CPUs. However, you must understand that resources such as memory are more required for concurrent processing of serial processing. Whether to use parallelism or serial travel is automatically evaluated and selected by MSSQL. A single task is divided into multiple tasks and can be run on the processor. For example, if the sort, connection, scan, and group by statements of delayed queries are executed simultaneously, SQL Server determines the optimal parallel level based on the system load, complex queries that consume a large amount of CPU are most suitable for parallel processing. However, update, insert, and delete operations cannot be processed in parallel.
8. If you use like for query, you cannot simply use index, but the full-text index consumes space. Like 'a % 'when the index like' % a' is used and like '% A %' is not used for the query, the query time is proportional to the total length of the field value, so the char type cannot be used, but varchar. Create a full-text index for a long field value.
9. Separate DB server and application server; Separate OLTP and OLAP.
10. Distributed partition view can be used to implement Database Server consortium. A consortium is a group of separately managed servers, but they collaborate to share the processing load of the system. This mechanism of forming Database Server consortium through partition data can expand a group of servers to support the processing needs of large multi-layer Web sites. For more information, see designing a database federation server. (Refer to the SQL Help File 'partition view') before implementing the partition view, you must first partition the table horizontally.
After creating a member table, define a distributed partition view on each Member Server, and each view has the same name. In this way, queries that reference the view name of a distributed partition can run on any Member Server. System operations are the same as if each member server has a copy of the original table, but in fact each server has only one member table and a distributed partition view. The data location is transparent to the application.
11. Rebuild the index dbcc reindex, dbcc indexdefrag, shrink data and log dbcc shrinkdb, and dbcc shrinkfile. set automatic log shrinking. for large databases, do not set Automatic database growth, which will reduce the server performance. The writing of T-SQL is very important. The following lists common points: first, the process of DBMS processing the query plan is as follows:
Query statement lexical and syntax check.
Submit the statement to the query optimizer of the DBMS.
Optimizer performs algebra optimization and access path optimization for SQL Server databases.
The pre-compilation module generates a query plan.
Then, it is submitted to the system for processing and execution at the appropriate time.
Finally, the execution result is returned to the user. Next, let's take a look at the data storage structure of SQL SERVER: the size of a page is 8 K (8060) bytes, and 8 pages are a disk area, store data in the Tree B.
12. Difference Between Commit and rollback Rollback: Roll back all things. Commit: Submit the current transaction. there is no need to write things in dynamic SQL. If you want to write things, write them out, such as begin tran exec (@ s) commit trans, or write dynamic SQL into functions or stored procedures. [SPAN]
13. Use the Where clause in the Select statement to limit the number of returned rows to avoid table scanning. If unnecessary data is returned, the server's I/O resources are wasted, this increases the burden on the network and reduces performance. If the table is large, the table is locked during the table scan and other connections are prohibited from accessing the table. The consequence is serious.