If you want to use SQL Server databases effectively, you will end up using stored procedures. Their aim is that you have optimized and compiled code that resides in a cache to improve workload performance for subsequent executions. However, you might find that it does not always work out that way.

The performance of a stored procedure is heavily dependent on how the plan is chosen and cached. If the plan is not optimal for subsequent executions it could cause performance to suffer greatly. In the end, you might suffer from what is known as parameter-sniffing-problems where the optimal plan for a procedure varies based on the parameters supplied.

This comprehensive course will teach you how stored procedure plan caching works and how to get SQL Server to produce the optimal plan for your stored procedure performance in a variety of circumstances. The course is applicable to SQL Server developers and anyone who is responsible for writing stored procedures that must repeatedly perform well.

The demo database provided is compatible with SQL Server 2008 through SQL Server 2014. All course demos are shown on SQL Server 2014 with references to behaviors (where different) on all versions. Optimization strategies you will learn in the course apply to SQL Server 2005 onward, and some even back to SQL Server 2000.
Author Name: Kimberly L. Tripp
Author Description:
Kimberly L. Tripp is a SQL Server MVP and a Microsoft Regional Director and has worked with computers since 1985. Since 1995, Kimberly has worked as a Speaker, Writer, Trainer and Consultant for her own company SQLskills.com which she now runs with her husband – Paul Randal. Working together Kimberly and Paul enjoy the ability to work on different types of projects – from Immersion Events to consulting to speaking at conferences to writing articles and books. Kimberly has presented lectures and … more

Table of Contents

• Introduction
  21mins
• Why Use Stored Procedures?
  27mins
• Creation, Compilation, and Invalidation Section 1
  68mins
• Creation, Compilation, and Invalidation Section 2
  53mins
• Optimization and Recompilation Section 1
  55mins
• Optimization and Recompilation Section 2
  51mins
• Optimization and Recompilation Section 3
  68mins
• Optimization and Recompilation Section 4
  62mins
• Other Concerns and Considerations
  23mins