A heap-table stores the rows in an unordered fashion. Index-organized tables and clustered indexes are the alternative. They store the rows in an ordered B-Tree structure.

About the Author

Photo of Markus Winand
Markus Winand tunes developers for high SQL performance. He also published the book SQL Performance Explained and offers in-house training as well as remote coaching at http://winand.at/