Clustered Index internal structure

Question

Will a clustered index in SQL Server 2008 R2 create an additional B-tree structure like in case of nonclustered index, where each element of the B-tree contains value and data locator?

Or SQL server just sorts all the table by the clustered index column?

A clustered index is both a navigation structure (the B-Tree part), as well as the actual data pages at the leaf level of the navigation tree. Once you've navigated through the tree, you are directly at the corresponding data page and all the columns of the entry are available to oyu — marc_s
– marc_s, Commented May 31, 2013 at 13:53

RBarryYoung · Accepted Answer · 2013-05-31 13:27:08Z

2

Clustered Index by definition is the data and is stored with the index on disk in the order of the index itself. Instead of pointers to the data, the actual data is part of the index node.

http://msdn.microsoft.com/en-us/library/ms177443(v=sql.105).aspx

edited May 31, 2013 at 13:27

RBarryYoung

57k15 gold badges99 silver badges143 bronze badges

answered May 31, 2013 at 13:20

Chris H

5452 silver badges7 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Martin Smith Over a year ago

The on disc order is not necessarily the same as the index key order. e.g. if data is inserted in the middle of the index the new pages allocated could be anywhere in the file.

Collectives™ on Stack Overflow

Clustered Index internal structure

1 Answer 1

1 Comment

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

1 Comment

Your Answer

Sign up or log in

Post as a guest

Related