THE SQL Server Blog Spot on the Web

Welcome to SQLblog.com - The SQL Server blog spot on the web Sign in | |
in Search

Browse by Tags

All Tags » Query Plans   (RSS)
Showing page 1 of 5 (46 total posts)
  • Mastering Execution Plan Analysis - Melbourne 6 Feb 2015

    Over the years I have spent working with SQL Server, the personal time investment that has repaid itself more than any other is becoming intimately familiar with execution plans and how they can be used to diagnose and correct performance problems. There is nothing I enjoy more than talking about execution plans, the query optimizer, and how ...
    Posted to Paul White: Page Free Space (Weblog) by Paul White on November 26, 2014
  • SQL Intersection Conference, Las Vegas MGM Grand 10-13 November 2014

    I am very pleased to announce that I will be speaking at the SQL Intersection conference in Las Vegas again this year. This time around, I am giving a full-day workshop, "Mastering SQL Server Execution Plan Analysis" as well as a two-part session, "Parallel Query Execution" during the main conference. The workshop is a ...
    Posted to Paul White: Page Free Space (Weblog) by Paul White on July 31, 2014
  • Hey Amsterdam and Stockholm: Just Say No to Guessing About Performance!

    Have SQL Server performance problems? What are you going to look at? Can you quickly isolate the root cause? Or do you ever find yourself stuck, not sure of what to do next? That's what the No More Guessing seminar is all about. This seminar teaches you to use:Baselining: An analytical methodology based on statistical analysis and evidence ...
    Posted to Adam Machanic (Weblog) by Adam Machanic on September 20, 2013
  • Nested Loops Prefetching

    Nested loops join query plans can be a lot more interesting (and complicated!) than is commonly realized. One query plan area I get asked about a lot is prefetching. It is not documented in full detail anywhere, so this seems like a good topic to address in a blog post. The examples used in this article are based on questions asked by Adam ...
    Posted to Paul White: Page Free Space (Weblog) by Paul White on August 30, 2013
  • T-SQL Tuesday: What kind of Bookmark are you using?

    I’m glad there is no minimum length requirement for T-SQL Tuesday blog posts, because this one will be short. I was in the classroom for almost 11 hours today, and I need to be back tomorrow morning at 7:30. Way long ago, back in SQL 2000 (or was it earlier?) when a query indicated that SQL Server was going to use a nonclustered index to get ...
    Posted to Kalen Delaney (Weblog) by Kalen Delaney on June 10, 2013
  • Execution Plan Analysis: The Mystery Work Table

    I love SQL Server execution plans. It is often easy to spot the cause of a performance problem just by looking at one. The task is considerably easier if the plan includes run-time information (a so-called ‘actual’ execution plan), but even a compiled plan can be very useful. Nevertheless, there are still times where the execution plan does not ...
    Posted to Paul White: Page Free Space (Weblog) by Paul White on March 7, 2013
  • Halloween Protection – The Complete Series

    I have just published a four-part series for SQLPerformance.com on the Halloween Problem. Some of you will never have heard of this issue, and those that have might associate it only with T-SQL UPDATE queries. In fact, the Halloween problem affects execution plans for INSERT, UPDATE, DELETE and MERGE statements. This is a topic I have been ...
    Posted to Paul White: Page Free Space (Weblog) by Paul White on February 20, 2013
  • Geek City: Join With Me!

    I remember one of the most surprising changes in SQL Server 2000 2005 was how the graphical plans showed the use of a nonclustered index to seek, and the plan included something that looked like a JOIN to find rows in the base table.  Here’s an example. Although I used SQL Server 2008R2, the graphical plan will be pretty similar to what it ...
    Posted to Kalen Delaney (Weblog) by Kalen Delaney on February 14, 2013
  • Optimizing T-SQL queries that change data

    Most tuning efforts for data-changing operations concentrate on the SELECT side of the query plan. Sometimes people will also look at important storage engine considerations like locking and transaction log throughput that can have dramatic effects. As a consequence, a number of common practices have emerged, such as avoiding large numbers of ...
    Posted to Paul White: Page Free Space (Weblog) by Paul White on January 25, 2013
  • MERGE Bug with Filtered Indexes

    A MERGE statement can fail, and incorrectly report a unique key violation when: The target table uses a unique filtered index; and No key column of the filtered index is updated; and A column from the filtering condition is updated; and Transient key violations are possible Example Tables Say we have ...
    Posted to Paul White: Page Free Space (Weblog) by Paul White on December 9, 2012
1 2 3 4 5 Next >
Powered by Community Server (Commercial Edition), by Telligent Systems
  Privacy Statement