Indexes: An Overview and Maintenance for PerformanceLearn MPS Technology on mps-technology.net. Indexes: An Overview and Maintenance for Performance article will help answer your questions on MPS Technology.We at mps-technology.net specialize in MPS Technology. MPS Technology at mps-technology.net provides the most up to date news and articles. If you have questions please do not hesitate to contact us.
For more information on how Clustered and Non-Clustered indexes store data visit http://www.sql-server-performance.com/gv_index_data_structures.asp While I could go on and on about how SQL Server 2000 stores and accesses data in a heap and in an Index architecture, I will move on to discuss maintaining indexes with DBCC SHOWCONTIG and DBCC INDEXDEFRAG. Once indexes have been created, it is important to maintain indexes to ensure the best possible performance. There are a number of tools available that will help with optimizing indexes to ensure they are running well, however I will only discuss DBCC SHOWCONTIG and DBCC INDEXDEFRAG in this article. The DBCC SHOWCONTIG command will provide fragmentation information on data and indexes within a specified table and it will also determine if the data and index pages are full. When the statement is executed, here is what will be returned: Statistic Description Pages Scanned Number of pages in the table or index. Extents Scanned Number of extents in the table or index. Extent Switches Number of times the DBCC statement moved from one extent to another while it traversed the pages of the table or index. Avg. Pages per Extent Number of pages per extent in the page chain. Scan Density [Best Count: Actual Count] Best count is the ideal number of extent changes if everything is contiguously linked. An out of Article: Many people know the importance of creating indexes on SQL Server database tables. Indexes greatly improve the performance of a database. However, while many people create indexes on their SQL Server tables, many people don't maintain them properly to ensure queries run efficiently as possible. I'll go ahead by giving a quick overview of how SQL Server 2000 stores data and how indexes improve performance. Then, I'll spend quite a bit of time explaining why, when, and how to maintain indexes with DBCC SHOWCONTIG and DBCC INDEXDEFRAG to ensure queries run in the most efficient manner. SQL Server 2000 stores data into what is known as a heap. A heap is a comparison of data pages containing rows for a table. The data isn't stored in any particular order and the data pages themselves aren't in any sequential order. The data is just there with no real form or organization. When SQL Server accesses data in this form, it does a table scan. This means SQL Server starts reading at the first crack of the table and scans every page until it finds the data that meets the criteria of the query. If a table is very large, this could greatly decrease the performance of queries. Indexes will hasten the retrieval of data. It is important to understand how data is used, the types of queries as is performed and the frequency of the queries that are typically performed when planning to create indexes. An index is far more efficient when the query results return a low percentage of rows and the selectivity is high. High selectivity means a query is written so it returns the lowest number of rows possible. As a rule, indexes should be created on columns that are again and again searched; this includes primary and foreign keys. It follows that columns that contain few unique values should never be indexed; this will increase the number of rows returned in a query. There are two types of indexes to consider when planning: Non-Clustered and gathered Indexes. A non-clustered index stores data en rapport to the index of a text book. The index is created in a different location than the physical data. The structure creates an index with a pointer that points to the that be location of the data. Non-clustered indexes should be created on columns where the selectivity of query ranges from highly selective to unique. These indexes are useful when providing multiple ways to search data is desired. A knotted index stores data similar to a phone directory where all people with the same last name are grouped together. SQL Server will quickly search a table with a packaged index while the index itself determines the sequence in which rows are stored in a table. packaged indexes are useful for columns searched frequently for ranges of values, or are accessed in sorted order. Each table can have only one knotted index, however up to 249 stacked indexes can be further per table. For more information on how packaged and Non-Clustered indexes store data visit http://www.sql-server-performance.com/gv_index_data_structures.asp While I could go on and on alongside how SQL Server 2000 stores and accesses data in a heap and in an Index architecture, I will move on to discuss maintaining indexes with DBCC SHOWCONTIG and DBCC INDEXDEFRAG. Once indexes have been created, it is important to maintain indexes to ensure the best possible performance. If indexes are not maintained, over time the data will be born fragmented. Fragmentation is the inefficient use of pages within an index*. There are a number of tools off that will help with optimizing indexes to ensure they are running well, however I will only discuss DBCC SHOWCONTIG and DBCC INDEXDEFRAG in this article. The DBCC SHOWCONTIG decide will provide fragmentation information on data and indexes within a specified table and it will also determine if the data and index pages are full. If a page is full, SQL Server must split the page to make room for new rows. This statement should be run on heavily modified tables, tables that contain imported data, or tables that seem to agent poor query performance. When the statement is executed, here is what will be returned: Statistic Description Pages Scanned Number of pages in the table or index. Extents Scanned Number of extents in the table or index. Extent Switches Number of times the DBCC statement moved from one extent to accessory while it traversed the pages of the table or index. Avg. Pages per Extent Number of pages per extent in the page chain. Scan Density [Best Count: present-day Count] Best count is the ideal number of extent changes if everything is contiguously linked. hard count is the being number of extent changes. The number in scan density is 100 if everything is contiguous; if it is less than 100, some fragmentation exists. Scan density is a percentage. Logical Scan Fragmentation Percentage of out-of-order pages returned from scanning the leaf pages of an index. This number is not relevant to heaps and text indexes. An out of order page is one for which the next page indicated in an IAM is a different page than the page pointed to by the next page pointer in the leaf page. Extent Scan Fragmentation Percentage of out-of-order extents in scanning the leaf pages of an index. This number is not relevant to heaps. An out-of-order extent is one for which the extent containing the current page for an index is not physically the next extent later than the extent containing the previous page for an index. Avg. Bytes free per page double number of free bytes on the pages scanned. The higher the number, the less full the pages are. Lower numbers are better. This number is also queer by row size; a large row size can result in a higher number. Avg. Page density (full) bourgeois page density (as a percentage). This value takes into history row size, so it is a more meticulous indication of how full your pages are. The higher the percentage, the better. The DBCC INDEXDEFAG hexadecimal system will rebuild a specified index or all indexes for a specific table. This occupy also allows use of the fillfactor option which reduces the number of page splits per data or index page. Using the fillfactor option increases performance on insert and upstate statements. If a data page is full, SQL Server must split the page to make room for the new rows. The fillfactor allows specification of a percentage of space to leave unpopulated on the data pages for inserts and updates. Let's observe an example: Running the query on a table titled member: DBCC SHOWCONTIG (member) WITH ALL_INDEXES DBCC SHOWCONTIG scanning 'member' table... Table: 'member' (786101841); index ID: 2, database ID: 14 LEAF level scan performed. - Pages Scanned................................: 192 - Extents Scanned..............................: 26 - Extent Switches..............................: 187 - Avg. Pages per Extent........................: 7.4 - Scan Density [Best Count:Actual Count].......: 12.77% [24:188] - Logical Scan Fragmentation ..................: 48.96% - Extent Scan Fragmentation ...................: 96.15% - Avg. Bytes Free per Page.....................: 6721.0 - Avg. Page Density (full).....................: 16.96% DBCC execution completed. If DBCC printed error messages, contact your system administrator. Running the query on a table named provider: DBCC SHOWCONTIG (provider) WITH ALL_INDEXES DBCC SHOWCONTIG scanning 'provider' table... Table: 'provider' (850102069); index ID: 2, database ID: 14 LEAF level scan performed. - Pages Scanned................................: 3 - Extents Scanned..............................: 1 - Extent Switches..............................: 0 - Avg. Pages per Extent........................: 3.0 - Scan Density [Best Count:Actual Count].......: 100.00% [1:1] - Logical Scan Fragmentation ..................: 33.33% - Extent Scan Fragmentation ...................: 0.00% - Avg. Bytes Free per Page.....................: 5596.0 - Avg. Page Density (full).....................: 30.86% DBCC execution completed. If DBCC printed error messages, contact your system administrator. There are a few specific things to take note of and will help determine if index pages are full or if they are heavily fragmented. The fullness of the index pages can be determined by reading the 'Avg. Bytes free per page' and 'Avg. Page density (full)' statistics. The 'Avg. Bytes free per page' figure should be low and the 'Avg. Page density (full)' figure should be high. You'll notice that both tables likely have very full pages. The fragmentation level of an index can be determined by parallelism the values of 'Extent Switches' and 'Extents Scanned' and having a dyed-in-the-wool understanding 'Logical Scan Fragmentation' and 'Extent Scan Fragmentation' values. The 'Extent Switches' should be virtually equal to 'Extents Scanned.' Based on the examples above, this is the way it should look. 'Logical Scan Fragmentation' and 'Extent Scan Fragmentation' values give a good indication of a table's fragmentation level. These values should be as constricted to zero as possible (10% may be acceptable). The 'member' table is highly fragmented and the provider table is slightly fragmented based on the numbers above. These issues can be corrected by dropping and recreating a aggregate index with the FILLFACTOR option specified. Also, the DBCC INDEXDEFRAG kingship will agreement an index, taking into sum its FILLFACTOR, which will improve the statistics. After running the queries below: DBCC DBREINDEX (member, '', 80) DBCC DBREINDEX (provider, '', 80) Running the queries: DBCC SHOWCONTIG (member) WITH ALL_INDEXES DBCC SHOWCONTIG (provider) WITH ALL_INDEXES DBCC SHOWCONTIG scanning 'member' table... Table: 'member' (786101841); index ID: 2, database ID: 14 LEAF level scan performed. - Pages Scanned................................: 41 - Extents Scanned..............................: 6 - Extent Switches..............................: 5 - Avg. Pages per Extent........................: 6.8 - Scan Density [Best Count:Actual Count].......: 100.00% [6:6] - Logical Scan Fragmentation ..................: 0.00% - Extent Scan Fragmentation ...................: 0.00% - Avg. Bytes Free per Page.....................: 1657.0 - Avg. Page Density (full).....................: 79.53% DBCC execution completed. If DBCC printed error messages, contact your system administrator. DBCC SHOWCONTIG scanning 'provider' table... Table: 'provider' (850102069); index ID: 2, database ID: 14 LEAF level scan performed. - Pages Scanned................................: 2 - Extents Scanned..............................: 2 - Extent Switches..............................: 1 - Avg. Pages per Extent........................: 1.0 - Scan Density [Best Count:Actual Count].......: 50.00% [1:2] - Logical Scan Fragmentation ..................: 0.00% - Extent Scan Fragmentation ...................: 0.00% - Avg. Bytes Free per Page.....................: 4346.0 - Avg. Page Density (full).....................: 46.31% DBCC execution completed. If DBCC printed error messages, contact your system administrator. As a result of running the DBCC SHOWCONTIG and DBCC INDEXDEFRAG commands, we were able to diagnose and greatly reduce fragmentation on the 'member' and 'provider' tables. The member table is as good as perfect and the 'provider' table shows great improvement. This will result in an extraordinary performance increase on queries that are run up against these tables. *For more information on fragmentation, visit this link: www.sql-server-performance.com/ Desiree Harris is a support specialist with ORCS Web, Inc. - a detachment that provides managed hosting services for clients who develop and deploy their applications on Microsoft Windows platforms.
|
Advice Home Business Technology Online Advertising Motivational Internet Marketing SEO Help Online Games Science Articles Happiness More Articles:1. ERP and CAD Integration in Engineer-to-Order Environment Summary: Following the work of the design engineer, a production engineer then creates a bill of materials (BOM), based on how it will be manufactured, not on how the product is designed. Automation.com attracts engineers, programmers, designers, technicians and other professionals who specify, purchase and use control systems, software, robotics, sensors and other supporting products to automate machines, equipment and factories in both discrete and continuous manufacturing processes. Article:T… 2. Easy Tips for Digital Photo Touchups Summary: Using a digital camera to take pictures is great. Here are some quick tips to improving your photo quality.Probably the best way to fix digital photo touchups is to not have any! But remember, a good piece of software shouldn't cost you a ton either.Standard software should provide for red eye removal, noise reduction, cropping, and other digital issues. Article: Using a digital concave lens to take pictures is great. It's easy and quick. Just as easy and quick is touching up those digi… 3. Computer Consulting 101 PC Troubleshooting Advice Summary:While most small businesses really do need to find a good local computer consulting business to take care of their computer problems, there are some computer problems that are simple enough for even a technophobe to handle. so you can conserve your computer consulting budget for those problems that really require expert assistance.About the AuthorJoshua Feinberg, co-founder of Computer Consulting 101, is a 15-year computer consulting veteran and has appeared in dozens of business and IT … 4. Web Services: Revolution or Evolution? Summary: What is left then is to simply continue on within the principles of who knows the most regarding programming that may best make it accessible to a new market of internet dependent companies and individuals. The trade media in IT so often favors any idea or development based solely on the brand attached to it that little is being done to filter out what is good from what is just more puff marketing. Article: Web Services: Revolution or Evolution? Can smaller vendors hope to compete with … |
||||
