The pages at each level of an index are linked together in a doubly-linked list (using the m_nextPage and m_prevPage fields in their page headers) to allow ascending-order and descending-order scans, based on the index key(s). Data pages in a heap are NOT linked together, as theres no ordering in a heap. However, there is [&]

The post When heap data pages become linked& appeared first on Paul S. Randal.

http://feedproxy.google.com/~r/PaulSRandal/~3/FbtC808-S7k/