Indexing InternalsDenny Cherry

mrdenny@mrdenny.comtwitter.com/mrdenny

2

About MeAuthor or Coauthor of 4 books6+ SQL Mag articlesDozens of other articlesMicrosoft MVP since Oct 2008Microsoft Certified MasterFounder of SQL ExcursionsSr. DBA for Phreesia

What we’ll be covering…Clustered IndexesNon-Clustered Indexes

Filtered Indexes

What we won’t be covering…Spacial IndexesFull Text IndexesCompressed Indexes

Structures…Indexes are made up of B-Trees which make

the index navigableIndexes are almost always made up of at

least two data pages.A Root PageA Leaf PageClustered Indexes also have Data Pages

Lets look at some pretty pictures…

Clustered Index

Clustered Index Data PageContains one row for every row in the tableContains all in row dataContains pointers to out of row data

TEXTNTEXTIMAGE

Contains pointers to overflow dataXMLVARCHAR(MAX)NVARCHAR(MAX)VARBINARY(MAX)

Slot ArrayShows what row within the page each row

occupiesContains the Clustered Index value and row

id only

Clustered Index Intermediate LevelsContains one row, for each page below itEach row contains…

Clustered Key ValueFile Id (2 bytes)Page Id (4 bytes)Row Overhead (At least one byte)

Row Overhead?1 Byte by defaultNulls?Variable Width Data Types?

Clustered Index Root PageOnly a single root page can existContains one row, for each page below itEach row contains…

Clustered Key ValueFile Id (2 bytes)Page Id (4 bytes)Row Overhead (At least one byte)

Navigating The Clustered Index

Splitting the Root Page

Uniqueifier … Non-Unique clustered indexes have an extra

column called the uniqueifier which ensures that values within the index are unique.

Uniqueifier is only used for rows which are not unique. EmpId Uniqufier

1  

2  

3  

4 0

4 1

5  

6  

7 0

7 1

8  

Non-Clustered Index

Nonclustered Index Intermediate PageContains one row for every row in the tableContains indexed value and clustered index

key or RID

NonClustered Index Root PageOnly a single root page can existContains one row, for each page below itEach row contains…

Indexed Key ValueClustered Key Value or RID (if index is not

unique)File Id (2 bytes)Page Id (4 bytes)Row Overhead (At least one byte)

Navigating The NonClustered Index

Navigating The Clustered Index

B-Tree SizesEach B-Tree page can store info about X child

pages…INT = 8096/13 bytes = 622 pagesBIGINT = 8096/17 bytes = 476 pagesGUID = 8096/25 bytes = 323 pages

Sample Index SizeRoot Level = 1 pageIntermediate Level = 7 pagesData Pages = 11233 pages

Another page level requires 7,650,600 data pages for a fourth level

Denny Cherrymrdenny@mrdenny.com

http://itke.techtarget.com/sql-server

Please fill out the survey at http://speakerrate.com/mrdenny.