Data Modification and Index Performance Considerations
It is widely known that an index can help speed data retrievals; from time to time, you might hear someone say that indexes slow down other operations, such as inserts, updates, and deletes, which is true. It has been mentioned that B-Tree data structures are, for the most part, self-maintaining data structures. As rows are added, deleted, or updated, the indexes also are updated to reflect the changes, requiring extra I/O to update the index pages.
SQL Server 7 introduced several performance improvements, also available in SQL Server 2000, to greatly reduce the disk I/O required to maintain indexes. One feature worth noting is that nonclustered indexes no longer have to be updated when a ...
Get Microsoft® SQL Server™ 2000 DBA Survival Guide, Second Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
