Advanced T-SQL Querying, Programming and Tuning for SQL Server 2005 & 2008

Prerequisites:

Course Description:

The course focuses on writing and tuning queries and programming with T-SQL in SQL Server 2005 and 2008. In this course you will learn the details and capabilities of T-SQL in the following areas: Logical Query Processing; Query Tuning; Subqueries, Ranking Functions, Joins and Set Operations; Aggregating and Pivoting Data; TOP and APPLY; Data Modification; Data Type Related Problems; Programmable Objects (Dynamic SQL, Views, User Defined Functions, Stored Procedures, Triggers, Transactions and Concurrency, Exception Handling); Graphs, Trees and Hierarchies.

Along the course you will learn how to use T-SQL to solve practical problems such as: Relational Division, Ranking, Missing and Existing Values (Islands and Gaps), Separating Elements, Tie Breakers, Running Aggregations, Pivoting and Unpivoting, Custom Aggregations, Histograms, Dynamic Analysis of Grouping Sets, TOP Problems, Paging, Median, Handling Sequences, and more.

You will learn how to tune your queries, how to develop efficient routines including user defined functions, stored procedures and triggers, work in multi-user environments with transactions and isolation levels, and use dynamic SQL securely and efficiently.

You will also learn how to maintain and query hierarchical data. You will learn what graphs, trees and hierarchies are, what the common requests against graphs are, and how to write T-SQL code to handle those requests. Several different solutions will be presented including: Enumerated Paths, Nested Sets, Nested Iterations using Recursive Queries, and using the HIERARCHYID datatype.

The course provides a dedicated module focusing on query tuning. The module covers internals and index tuning, index access methods, temporary tables, set vs. cursors, and query tuning using query revisions. Moreover, query tuning is in the heart of this course and is incorporated in the different modules throughout the course.

With each querying/programming problem the discussions will revolve around logical aspects, set-based vs. procedural programming and optimization of the solutions.

This course was developed by Itzik Ben-Gan, a mentor and one of the founders of Solid Quality Mentors, author of several books about T-SQL, a columnist in SQL Server Magazine, and a regular speaker in SQL Server related events.

Delegates will learn how to:

• Understand logical query processing
• Understand SQL Server's internal data structures
• Be able to analyze and tune query performance
• Be able to analyze query execution plans
• Be able to solve complex querying and programming problems
• Think in terms of sets
• Be able to compare set based and cursor based solutions
• Know how to handle date and time data
• Understand compilations, recompilations and reuse of execution plans
• Understand transactions and concurrency aspects of database programming
• Know how to handle hierarchical data and write recursive queries
• Be familiar T-SQL enhancements in SQL Server 2005 and 2008

This course includes the following modules:

Logical Query Processing

• Logical Query Processing Order
• Logical Query Processing Example
• Phase Details
• Set Operations

Query Tuning

• Internals and Index Tuning
• Temporary Tables
• Sets vs. Cursors
• Query Tuning with Query Revisions

Subqueries, Ranking Functions, Joins and Set Operations

• Subqueries
• Analytical Ranking Functions
• Joins
• Set Operations
• LAB 03A

Aggregating and Pivoting Data

• The OVER Clause
• Tie Breakers
• Running Aggregations
• Pivoting and Unpivoting Data
• Custom Aggregations
• Histograms
• Grouping Sets
• LAB 04A

TOP and APPLY

• TOP
• APPLY
• LAB 05A

Data Modification

• Inserting Data
• Deleting Data
• Updating Data
• Merging Data
• The OUTPUT Clause
• LAB 06A

Datatype Related Problems

• Date and Time Manipulation
• Datatype Enhancements
• LAB 07A

Programmable Objects

• Dynamic SQL
• Views
• User Defined Functions
• Stored Procedures
• Triggers
• Transactions and Concurrency
• Exception Handling
• LAB 08A

Graphs, Trees and Hierarchies

• Graphs, Described
• Common Requests against Graphs
• Enumerated Paths Model
• Nested Sets Model
• Recursive Queries
• The HIERARCHYID Datatype
• LAB 09A