http://blogs.msdn.com/craigfr/archive/2009/02/25/optimizing-i-o-performance-by-sorting-part-1.aspxIn this post from last year, I discussed how random I/Os are slower than sequential I/Os (particularly for conventional rotating hard drives). For this reason, SQL Server often favors query plans that perform sequential scans of an entire table over plansenCommunityServer 2.1 SP1 (Build: 61025.2)http://blogs.msdn.com/craigfr/archive/2009/02/25/optimizing-i-o-performance-by-sorting-part-1.aspx#9444459Wed, 25 Feb 2009 22:09:57 GMT91d46819-8472-40ad-a661-2c78acb4018c:9444459Click &amp; Solve &raquo; Optimizing I/O Performance by Sorting ??? Part 1 <p>PingBack from <a rel="nofollow" target="_new" href="http://www.clickandsolve.com/?p=14416">http://www.clickandsolve.com/?p=14416</a></p> http://blogs.msdn.com/craigfr/archive/2009/02/25/optimizing-i-o-performance-by-sorting-part-1.aspx#9444527Wed, 25 Feb 2009 23:01:21 GMT91d46819-8472-40ad-a661-2c78acb4018c:9444527DotNetShoutout<p>Thank you for submitting this cool story - Trackback from DotNetShoutout</p> http://blogs.msdn.com/craigfr/archive/2009/02/25/optimizing-i-o-performance-by-sorting-part-1.aspx#9458718Wed, 04 Mar 2009 20:31:22 GMT91d46819-8472-40ad-a661-2c78acb4018c:9458718Craig Freedman's SQL Server Blog<p>In my last post, I discussed how SQL Server can use sorts to transform random I/Os into sequential I/Os.</p> http://blogs.msdn.com/craigfr/archive/2009/02/25/optimizing-i-o-performance-by-sorting-part-1.aspx#9487000Wed, 18 Mar 2009 17:43:49 GMT91d46819-8472-40ad-a661-2c78acb4018c:9487000Craig Freedman's SQL Server Blog<p>In my past two posts, I explained how SQL Server may add a sort to the outer side of a nested loops join</p>