Optimization
SQL Server
DatabaseThere are many reasons for slow query speed, which are common in the following ways: 1. No index or no index is used (this is the most common problem of slow query and is a defect in programming) 2. Low I/O throughput, resulting in a bottleneck effect. 3. the query is not optimized because no computing column is created. 4. Insufficient memory 5. slow network speed 6. The queried data volume is too large (you can use multiple queries to reduce the data volume in other ways) 7. Lock or deadlock (this is also the most common problem of slow query and is a defect in programming) 8. sp_lock and sp_who are viewed by the active users because they are competing for read and write resources. 9. Unnecessary rows and columns are returned. 10. The query statement is not good. You can use the following method to optimize the query: 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 tables vertically and horizontally to reduce the table size (sp_spaceuse). 3. upgrade hardware. 4. Create indexes based on query conditions, optimize indexes, and optimize access methods, limit the data size 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 field 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. database server and Application Server are separated. OLTP and OLAP are separated. 10. The 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'.) A. before implementing the partition view, you must first Partition Table B horizontally and 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: 1. query statement lexical and syntax check 2. submit the statement to the query optimizer of the DBMS 3. Optimize the optimizer in algebra and optimize the access path 4. Generate a query by the Pre-compilation Module planning 5. Submit the execution results to the system at the appropriate time. 6. Finally, return the execution results to the user, take a look at the data storage structure of SQL server: the size of a page is 8 K (8060) bytes, and the size of the eight pages is a disk area, which is stored according to the B tree. 12. Difference Between commit and 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. 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. 14. The SQL statement does not affect execution. 15. Do not use the cursor as much as possible. It occupies a large amount of resources. If you need row-by-row execution, try to use non-cursor technology, such as loop on the client, using temporary tables, table variables, subqueries, and case statements. The cursor can be classified according to the extraction options it supports: only the rows must be extracted from the first row to the last row. Fetch next is the only allowed extraction operation and is also the default method. You can extract arbitrary rows randomly anywhere in the cursor. The cursor technology becomes very powerful in SQL2000, and its purpose is to support loops. There are four concurrent options read_only: update cannot be located through the cursor, and there is no lock in the rows that make up the result set. Optimistic with values: Optimistic Concurrency Control is a standard part of transaction control theory. Optimistic Concurrency control is used in this case. In the interval between opening the cursor and updating the row, there is only a small chance for the second user to update a row. When a cursor is opened with this option, there is no lock to control the rows, which will help maximize its processing capability. If you try to modify a row, the current value of the row is compared with the value obtained from the last row extraction. If any value changes, the server will know that the other person has updated the row and will return an error. If the value is the same, the server executes the modification. Select this concurrency option optimistic with row versioning: this optimistic concurrency control option is based on Row version control. Use row version control. The table must have a version identifier, which can be used by the server to determine whether the row is changed after the cursor is read. In SQL Server, this performance is provided by the timestamp data type. It is a binary number that indicates the relative sequence of changes in the database. Each database has a global current timestamp value: @ dbts. Every time you change a row with a timestamp column in any way, SQL Server first stores the current @ dbts value in the timestamp column, and then adds the value of @ dbts. If a table has a timestamp column, the timestamp is recorded as a row. The server can compare the current timestamp value of a row with the timestamp value stored during the last extraction to determine whether the row has been updated. The server does not need to compare the values of all columns. You only need to compare the timestamp column. If the application requires Optimistic Concurrency Based on Row Version Control for tables without a timestamp column, the cursor is optimistic concurrency control based on the value by default. Scroll locks implements pessimistic concurrency control. In pessimistic concurrency control, when the row of the database is read into the cursor result set, the application attempts to lock the row of the database. When a server cursor is used, an update lock is placed on the row when it is read into the cursor. If the cursor is opened in the transaction, the update lock of the transaction will be kept until the transaction is committed or rolled back. When the next row is extracted, the cursor lock will be removed. If the cursor is opened outside the transaction, the lock is discarded when the next row is extracted. Therefore, whenever you need full pessimistic concurrency control, the cursor should be opened in the transaction. The update lock prevents any other task from obtaining the update lock or exclusive lock, thus preventing other tasks from updating the row. However, the update lock does not prevent the shared lock, so it does not prevent other tasks from reading rows, unless the second task also requires reading with the update lock. Based on the lock prompts specified in the SELECT statement defined by the cursor, these cursor concurrency options can generate a scroll lock. The scroll lock is obtained on each row during extraction and is kept until the next extraction or cursor is closed. The first occurrence prevails. During the next extraction, the server obtains the scroll lock for the Newly Extracted row and releases the scroll lock of the last extracted row. The rolling lock is independent of the transaction lock and can be kept after a commit or rollback operation. If the option to close the cursor when submitting is off, the commit statement does not close any opened cursor, and the scroll lock is retained until it is committed to maintain isolation of the extracted data. The type of the obtained scroll lock depends on the cursor concurrency option and the lock prompt in the SELECT statement of the cursor. Lock prompt read-only optimistic value optimistic row version control lock No prompt not locked update nolock not locked holdlock sharing update updlock error Update tablockx Error unlocked unlocked update other unlocked update * The specified nolock prompt will make the table specified with this prompt read-only in the cursor. 16. Use profiler to track the query, obtain the time required for the query, and locate the SQL problem. Use the index optimizer to optimize the Index 17. Pay attention to the difference between Union and Union all. Union all is good 18. Pay attention to the use of distinct. Do not use it unless necessary. It will make the query slow like union. Duplicate records are correct during query 19. Do not return unwanted rows or columns 20 during query. Use sp_configure 'query Governor cost limit 'or set query_governor_cost_limit to limit query consumption. resources. When the resource consumed by the evaluation query exceeds the limit, the server automatically cancels the query and kills the query before the query. Set locktime: Set the lock time 21. Use select Top 100/10 percent to limit the number of rows returned by the user or set rowcount to limit the number of rows to be operated. Before SQL2000, do not use the following statements: "Is null", "<> ","! = ","!> ","! <"," Not "," not exists "," not in "," not like ", and" like '% 100' ", because they do not leave the index and are all table scans. Do not add a function to the column name in the WHERE clause, such as convert and substring. If a function is required, create a computed column and then create an index. you can also change the syntax of where substring (firstname,) = 'M' to where firstname like'm % '(index scan). You must separate the function from the column name. In addition, the index cannot be too large or too large. Not in scans the table multiple times and uses exists, not exists, in, left Outer Join instead, especially the left join. exists is faster than in, and the slowest operation is not. if the column value is null, its index does not work in the past. Now the 2000 optimizer can process it. The same is null, "not", "not exists", "not in" can optimize her, but "<>" cannot be optimized, and no index is used. 23. Use query analyzer to check the SQL statement query plan and evaluate and analyze whether the SQL statement is optimized. Generally, 20% of the Code occupies 80% of the resources, and our optimization focuses on these slow points. 24. If the in or query is not indexed, use the display statement to specify the index: Select * From personmember (Index = ix_title) Where processid in ('male ', 'Female ') 25. Pre-calculate the results to be queried and place them in the table. Select the results when querying. This was the most important method before sql7.0. For example, hospital hospitalization fee calculation. 26. Appropriate indexes can be used for Min () and max. 27. There is a principle in the database that the code is closer to the data, the better. Therefore, the default is the preferred one, which is rules, triggers, and constraint (constraints such as the external key checkunique ......, The maximum length of the data type, etc. are constraints), procedure. This not only requires low maintenance work, high programming quality, and fast execution speed. 28. If you want to insert a large binary value to the image column, use the stored procedure. Do not insert the value using an embedded insert Statement (whether Java is used or not ). In this way, the application first converts the binary value to a string (twice the size of the string), and then converts it to a binary value after the server receives the character. the stored procedure does not have these actions: Method: Create procedure p_insert as insert into table (fimage) values (@ image), and calls this stored procedure on the foreground to pass in binary parameters, this significantly improves the processing speed. 29. Between is faster in some cases than in, and between can locate the range based on the index faster. Use the query optimizer to see the difference. Select * From chineseresume where title in ('male', 'female ') Select * From chineseresume where between 'male' and 'female' are the same. Because in may be more than once, it may be slower sometimes. 30. If it is necessary to create an index for a global or local temporary table, it may increase the speed, but not necessarily because the index also consumes a lot of resources. Its creation is the same as that of the actual table. 31. Do not create useless things, such as wasting resources when generating reports. Use it only when necessary. 32. The or clause can be divided into multiple queries and connected to multiple queries through Union. Their speed is only related to whether an index is used. If a query requires a Union Index, Union all is more efficient. no index is used for multiple or statements, and it is rewritten to the form of union to try to match the index. Whether or not indexes are used in a key issue. 33. Use a view as little as possible, which is less efficient. Operations on a view are slower than operations on a table. You can replace it with stored procedure. In particular, do not use nested views. nested views increase the difficulty of searching for original data. Let's look at the essence of the View: it is an optimized SQL statement stored on the server that has produced a query plan. When retrieving data from a single table, do not use a view pointing to multiple tables. Read data directly from the view that only contains the table. Otherwise, unnecessary overhead is added, the query is disturbed. to speed up View query, MSSQL adds the View index function. 34. Do not use distinct or order by unless necessary. These actions can be executed on the client. They increase additional overhead. This is the same as Union and Union all. 35. In the post-in nominal value list, place the most frequent values at the beginning and the least value at the end to reduce the number of judgments. 36. When select into is used, it locks the system table (sysobjects, sysindexes, etc.) and blocks access from other connections. When creating a temporary table, use the show statement instead of select. drop table t_lxh begin Tran select * into t_lxh from chineseresume where name = 'xyz' -- commit in another connection select * From sysobjects You Can See That select into locks the system table, create Table also locks the system table (whether it is a temporary table or a system table ). So never use it in things !!! In this case, use real tables or temporary table variables for temporary tables that are frequently used. 37. Generally, redundant rows can be removed before group by having clauses, so try not to use them for row removal. Their execution sequence should be optimal as follows: Select WHERE clause Selects all appropriate rows, group by is used to group statistical rows, and having clause is used to remove redundant groups. In this way, the consumption of group by having is small, and queries are fast. Grouping and having large data rows consumes a lot of resources. If the purpose of group by is not to include computation but to group, it is faster to use distinct 38. The score for updating multiple records at a time is faster to update one record at a time, that is to say, 39 rows are processed in batches, less temporary tables are used, and result sets and table class variables are used as much as possible to replace them. The table type variables are 40 better than the temporary tables. In SQL2000, the calculated field can be indexed and must meet the following conditions: a. The expression of the calculated field is determined B. It cannot be used in text or ntext, image Data Type C. The following options must be prepared: ansi_nulls = on, ansi_paddings = on ,....... 41. Try to put data processing on the server to reduce network overhead, such as using stored procedures. Stored procedures are compiled, optimized, organized into an execution plan, and stored in the database as SQL statements. They are a collection of control flow languages and are fast. You can use a temporary stored procedure to execute dynamic SQL statements repeatedly. This process (temporary table) is stored in tempdb. In the past, because SQL server did not support complex mathematical computing, it had to put this job on another layer to increase network overhead. SQL2000 supports udfs and now supports complex mathematical computing. the return value of a function is not too large, which is costly. A user-defined function is executed like a cursor, which consumes a large amount of resources. If a large result is returned, the stored procedure is used. 42. Do not use the same function repeatedly in one sentence, wasting resources, put the result in the variable and then call faster 43. The efficiency of the select count (*) command is low. Try to change the method as much as possible, while the exists command is fast. note the difference: the return values of select count (field of null) from table and select count (field of not null) from table are different !!! 44. When the server has enough memory, the number of preparation threads = the maximum number of connections + 5, which can maximize the efficiency; otherwise, use the number of prepared threads <maximum number of connections to enable the SQL Server thread pool. If the number is equal to the maximum number of connections + 5, the performance of the server is seriously damaged. 45. Access your table in a certain order. If you lock table A and table B first, lock them in this order in all stored procedures. If you first lock table B in a stored procedure and then lock Table A, this may lead to a deadlock. If the lock sequence is not designed in detail in advance, it is difficult to find the deadlock 46. Monitor the load memory of the corresponding hardware through SQL server performance monitor: page faults/sec counters if this value increases occasionally, it indicates that there were threads competing for memory. If it continues high, memory may be the bottleneck. Process: 1.% DPC time indicates the percentage of services received and provided by the processor during the sample interval using the deferred program call (DPC. (DPC is running at a lower priority interval than the standard interval ). Because DPC is executed in privileged mode, the percentage of DPC time is part of the privileged time percentage. These time values are calculated separately and are not part of the total number of interval values. This total number shows the average busy hours as the percentage of instance time. 2. If the value of % processor time counter exceeds 95%, the bottleneck is the CPU. You can consider adding a processor or changing a faster processor. 3.% privileged time indicates the percentage of idle processor time used in privileged mode. (Privileged mode is a processing mode designed for operating system components and operating hardware drivers. It allows direct access to hardware and all memory. Another mode is the user mode. It is a finite processing mode designed for applications, Environment subsystems, and integer subsystems. The operating system converts the application thread to the privileged mode to access the Operating System Service ). The privileged time % includes the time when the service is interrupted and the DPC is provided. The high privileged time ratio may be caused by a large number of failed device intervals. This counter displays the average busy hours as part of the sample time. 4.% USER time indicates CPU-consuming database operations, such as sorting and executing Aggregate functions. If the value is very high, you can consider increasing the index and try to reduce the value by using simple table join and horizontal table segmentation methods. Physical Disk: curretn disk queue length counter this value should not exceed 1.5 ~ 2 times. To improve performance, you can add disks. Sqlserver: cache hit ratio counter. The higher the value, the better. If the duration is lower than 80%, consider increasing the memory. Note that the value of this parameter is accumulated after SQL Server is started. Therefore, after running for a period of time, this value cannot reflect the current value of the system. 47. Analyze select emp_name form employee where salary> 3000 in this statement, if salary is of the float type, the optimizer optimizes it to convert (float, 3000 ), because 3000 is an integer, we should use 3000.0 during programming, instead of waiting for the DBMS to convert at runtime. Conversion of the same character and integer data. 48. Select. personmemberid, * From chineseresume A, personmember B where personmemberid = B. referenceid and. personmemberid = 'jcnprh1_1 '(A = B, B = 'number') Select. personmemberid, * From chineseresume A, personmember B where. personmemberid = B. referenceid and. personmemberid = 'jcnprh1_1 'and B. referenceid = 'cnprh1_1 '(A = B, B = 'number', A = 'number') Select. personmemberid, * fro M chineseresume A, personmember B where B. referenceid = 'jcnprh1_1 'and. personmemberid = 'cnprh1_1' (B = 'number', A = 'number') 49, (1) if no owner code is entered, then code1 = 0 code2 = 9999 else code1 = code2 = owner code end if the SQL statement is: Select owner name from p2000 where owner code >=: code1 and owner code <=: code2 (2) If no owner code is entered, then select owner name from p2000 else code = owner code select owner code from p2000 where owner code =: code end if the first method only uses one SQL statement, and the second method Two SQL statements are used. When no owner code is entered, the second method is obviously more efficient than the first method because it has no restrictions. When the owner code is entered, the second method is still more efficient than the first method. It not only lacks one restriction condition, but also is the fastest query operation because of equality. Do not worry about writing programs 50. About the new method of querying pages in jobcn (as shown below), use the performance optimizer to analyze performance bottlenecks. If it is at I/O or network speed, the following method is effective. It is better to use the current method on the CPU or memory. Please differentiate the following methods, indicating that the smaller the index, the better. Begin declare @ local_variable table (FID int identity (1, 1), referenceid varchar (20) insert into @ local_variable (referenceid) select top 100000 referenceid from chineseresume order by referenceid select * From @ local_variable where FID> 40 and FID <= 60 end and begin declare @ local_variable table (FID int identity ), referenceid varchar (20) insert into @ local_variable (referenceid) select top 100000 referenceid from chineseresume order by updatedate select * From @ local_variable where FID> 40 and FID <= 60 end different begin create table # temp (FID int identity ), referenceid varchar (20) insert into # temp (referenceid) select top 100000 referenceid from chineseresume order by updatedate select * from # temp where FID> 40 and FID <= 60 drop table # temp end
