Abstract
To maximize the benefit from nonclustered indexes, you must minimize the cost of the data retrieval as much as possible. A major overhead associated with nonclustered indexes is the cost of excessive lookups, formerly known as bookmark lookups, which are a mechanism to navigate from a nonclustered index row to the corresponding data row in the clustered index or the heap. Therefore, it makes sense to look at the cause of lookups and to evaluate how to avoid this cost.
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). Lookup Analysis. In: SQL Server 2012 Query Performance Tuning. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4302-4204-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4302-4204-8_6
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