***THIS EVENT IS SOLD OUT. However, please let us know if you are interested in taking this class at another time by e-mailing kate@dataeducation.com. If we have enough interest, we will once again offer it in the area. Thank you!***

Today's database workloads are all about bigger, better, and more: bigger data, better analytics, and more insights. While these improvements can be great for your business users, on the technology side they often translate into large, lumbering queries that monopolize the server and test the patience of even the calmest of analysts. This full-day seminar is specifically designed to help you tune these extra tough queries. The day begins by establishing a solid foundation for reading and understanding how query plans work, and what is and is not important to pay attention to when reading a plan. Next you will learn about plan shaping: types of query rewrites that work, which rewrites are bound to fail, and the various query hints you might want to leverage in especially difficult situations. Real-world application of these techniques will be covered with a discussion around how to understand what kind of plan is ideal given the particulars of a situation, and the introduction of an approach to help you analyze and fix even the biggest query plans. The day concludes with a look at various indexing strategies and patterns--both common and alternative, including a look at the applicability of columnstores in SQL Server 2016 and beyond. You will leave the class armed with an array of tools and ideas to help you tame even the biggest queries in your environment.

Module 1: Query Plans

• How Query Plans Really Work

• Data Acquisition Iterators

• Join Iterators

• Aggregation and Analysis Iterators

• Parallel Processing

Module 2: Plan Shaping

• T-SQL Rewrites That Waste Your Time

• T-SQL Rewrites That Work

• Query Hints

• Leveraging Row Goals For Plan Control

• Understanding Ideal Plan Shape

• Performance Debugging Complex Plans

Module 3: Index Optimization

• The Levels of Index Understanding

• How B*Tree Indexes Really Work

• How to Design Optimal B*Tree Indexes

• How to Choose Among Indexing Options

• Columnstores vs. B*Trees

A light breakfast, coffee, and lunch are included.

About Adam Machanic

Adam Machanic is a Boston-based SQL Server developer, writer, and speaker. He focuses on large-scale data warehouse performance and development, and is author of the award-winning SQL Server monitoring stored procedure, sp_WhoIsActive. Adam has written for numerous web sites and magazines, including SQLblog, Simple Talk, Search SQL Server, SQL Server Professional, CoDe, and VSJ. He has also contributed to several books on SQL Server, including "T-SQL Querying" (Microsoft Press, 2015) and "SQL Server 2008 Internals" (Microsoft Press, 2009). Adam regularly speaks at conferences and training events on a variety of SQL Server topics. He is a Microsoft Most Valuable Professional (MVP) for SQL Server, a Microsoft Certified IT Professional (MCITP), and an alumnus of the INETA North American Speakers Bureau.

FAQs

What's the refund policy?

Terms and Conditions: If Data Education cancels the course, you will receive a 100% refund. Registration is fully transferable. If you cancel your registration with more than 30 days notice, Data Education will refund the fee minus $35 for processing. If you cancel your registration with between 16 and 30 days notice, Data Education will refund 75% of the fee. If you cancel your registration with between 7 and 15 days notice, Data Education will refund 50% of the fee. Cancellations will not be allowed as of 6 days before the beginning of the course.