We've already talked about how a level of an index looks a lot like a table.  Clustered indexes take this to the logical conclusion: they use the actual table as the leaf nodes of the index.  This means that we save a whole level of the index, which makes it faster than a non-clustered index.  (That's providing you need columns not in the index.  Otherwise index covering is typically faster.)  It also means that you've actually ordered the table according to the index. The ordering of the actual table is huge, and the ramifications are large.  The simplest, and...