<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Optimizing I/O Performance by Sorting – Part 2</title><link>http://blogs.msdn.com/craigfr/archive/2009/03/04/optimizing-i-o-performance-by-sorting-part-2.aspx</link><description>In my last post, I discussed how SQL Server can use sorts to transform random I/Os into sequential I/Os. In this post, I'll demonstrate directly how such a sort can impact performance. For the following experiments, I'll use the same 3 GByte database</description><dc:language>en</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>Click &amp;amp; Solve &amp;raquo;  Optimizing I/O Performance by Sorting ??? Part 2 </title><link>http://blogs.msdn.com/craigfr/archive/2009/03/04/optimizing-i-o-performance-by-sorting-part-2.aspx#9458731</link><pubDate>Wed, 04 Mar 2009 20:47:04 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9458731</guid><dc:creator>Click &amp;amp; Solve &amp;raquo;  Optimizing I/O Performance by Sorting ??? Part 2 </dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://www.clickandsolve.com/?p=17808"&gt;http://www.clickandsolve.com/?p=17808&lt;/a&gt;&lt;/p&gt;
</description></item><item><title>OPTIMIZED Nested Loops Joins</title><link>http://blogs.msdn.com/craigfr/archive/2009/03/04/optimizing-i-o-performance-by-sorting-part-2.aspx#9486998</link><pubDate>Wed, 18 Mar 2009 17:43:44 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9486998</guid><dc:creator>Craig Freedman's SQL Server Blog</dc:creator><description>&lt;p&gt;In my past two posts, I explained how SQL Server may add a sort to the outer side of a nested loops join&lt;/p&gt;
</description></item></channel></rss>