December 2017
Intermediate to advanced
434 pages
10h 14m
English
The clustered B-tree index seems to be very similar to non-clustered indexes, but there's one big difference. The index key is not copied to its separate storage but the table itself forms the leaf-level of the index. It's obvious that only one clustered index can be created by a table. When a clustered index is created, records in the table are sorted accordingly with the index definition and data pages are ordered in a double-linked list.
When SQL Server performs read on a clustered index, it could use these operations:
Read now
Unlock full access