Abstract
As explained in Chapter 4, index column values are stored in the leaf pages of an index’s B-tree structure. When you create an index (clustered or nonclustered) on a table, the cost of data retrieval is reduced by properly ordering the leaf pages of the index and the rows within the leaf pages. In an OLTP database, data changes continually, causing fragmentation of the indexes. As a result, the number of reads required to return the same number of rows increases over time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2012 Grant Fritchey
About this chapter
Cite this chapter
Fritchey, G. (2012). Fragmentation Analysis. In: SQL Server 2012 Query Performance Tuning. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4302-4204-8_8
Download citation
DOI: https://doi.org/10.1007/978-1-4302-4204-8_8
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4302-4203-1
Online ISBN: 978-1-4302-4204-8
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books