question

vinodkpasi avatar image
vinodkpasi asked

Clustered Index Structure

How does SQL Server organizes the table data in B tree structure? Consider for given table we create a clustered index on the TestID column, what will be the representation of B tree (root/intermediate/leaf node) and on what basis TestID values will go inside root/intermediate/leaf node? TestID Description ------------------------ 1 Test1 2 Test2 3 Test3 4 Test4 5 Test5 6 Test6 7 Test7 8 Test8
sqlindexing
1 comment
10 |1200
Toggle Comment visibility. Current Visibility: Viewable by all users

Up to 2 attachments (including images) can be used with a maximum of 512.0 KiB each and 1.0 MiB total.

Oleg avatar image Oleg commented ·
@vinodkpasi A good option to find the perfect answer to this interview question would be to fire up your favourite web browser, navigate to google home page, and then type the following in the provided search box: ***site sqlservercentral.com Gail Shaw introduction to indexes***. The first result of that search should be the link to the [Introduction to Indexes][1] articles by Gail Shaw (there are 3 parts, please read all of them). [Part II of the series][2] is specifically dedicated to clustered indexes. [1]: http://www.sqlservercentral.com/articles/Indexing/68439/ [2]: http://www.sqlservercentral.com/articles/Indexing/68563/
0 Likes 0 ·

0 Answers

·

Write an Answer

Hint: Notify or tag a user in this post by typing @username.

Up to 2 attachments (including images) can be used with a maximum of 512.0 KiB each and 1.0 MiB total.