Using Covering Indexes to Avoid Hashes and Sorts

In the previous installment, we saw that covering indexes can reduce the number of page reads required to satisfy specific queries, thereby improving performance for those queries. We’ll turn our attention now to some more subtle applications of covering indexes. For this, we will use the ContosoRetailDW sample database, which is considerably larger than the […]
Read More ›

Type to search blog.learningtree.com

Do you mean "" ?

Sorry, no results were found for your query.

Please check your spelling and try your search again.