• It is not accurate to say that the table has two indexes in this case.  Unlike a table with a clustered index (IndID = 1) which is well-ordered based on the index key, a heap table has no logical order.  It is simply a conglomeration of data.  Your table has just one index -- the non-clustered one you created.

    As such, for a heap table there is no concept of defragmenting the table.  The standard methods of DBCC INDEXDEFRAG and such do not work. 

    There can be issues with heap tables, see for example, Kalen Delaney's explanation at http://www.windowsitpro.com/SQLServer/Articles/ArticleID/25198/pg/2/2.html.  My understanding is that the only way to compact a heap table is to either reload it (move data out, truncate, move back in ) or to shrink the database itself.   I may have missed a method or two here, however.

    Scott Thornburg