Main Content

Blazing Fast Queries: When Indexes Are Not Enough

About the Talk

April 23rd, 2010 6:15 AM

Neuss (Dusseldorf), Germany

Neuss (Dusseldorf), Germany

If you want optimum performance in SQL Server, you have to use indexes. But what if you already implemented indexes and your solution is still slow or it doesn’t scale like you want? You may have to rethink the way you write your queries. How you write your queries is directly related to how you approach and solve your business problems, and you might think that the easiest way to solve them is with a procedural, row-by-row approach. But although cursors, loops, and user-defined functions (UDFs) might seem the easiest method, this "easier" way leads to slower performance, poor scalability, and more complex code that’s bug-prone and difficult to maintain. In this session, you’ll see how to use a set-based approach to solving problems, even those that most developers think are solvable only by using a procedural approach. We’ll then compare the two approaches to see the differences in terms of scalability, performance, and complexity. You'll be amazed at the boost in performance and maintainability you can give your applications!

Share URL:

Ratings and Recommendations

Avg. Rating

This Talk hasn't been rated yet. Sign In to rate Talks.

Other Talks at PASS European Conference 2010

comments powered by Disqus