Skip to content

shannonlowder.com

Menu
  • About
  • Biml Interrogator Demo
  • Latest Posts
Menu

SQL 202-Covered Indexes

Posted on January 12, 2011February 9, 2011 by slowder

By this point you should feel pretty comfortable with what an INDEX is and what it does for your queries.  Basically it provides the server to find your data rows more quickly by creating a look-up to find key values.  When teaching indexes I usually open the book closest to me, and show them the index in the back.  If you’re looking for the page about hybrid cars, turn to page 251.  I then turn to page 251, and show the page to the class.

Fast right?

Absolutely, but you can take this one step further.  A phone book is an index too, but it has extra information, phone numbers.  This is a lot like a covered index.  We index one column (or a couple columns), and we INCLUDE extra columns.  Then when the server hits an index it doesn’t have to leave the index and go to the table in order to retrieve that included column.

Consider this table:

CREATE TABLE contacts (
     contactID INT
   , firstname VARCHAR(255)
   , lastname VARCHAR(255)
   , phoneNumber VARCHAR(10)
   , <10, 20 more columns> )

We have a fairly wide table containing our contacts.  Fairly often we want to lookup  phone numbers by name (first and last). I’ll set up variables for the parameters of our lookup.

SELECT phoneNumber FROM contacts WHERE firstname = @firstname AND lastname = @lastname

We could make it pretty fast if we had an index on first and last name.

CREATE INDEX ix_contacts__firstname_lastname ON contacts (firstname, lastname)

Looking at the stats this index is pretty fast:

results came back in 60ms
Table 'contacts'. Scan count 9, logical reads 9062, physical reads 0, read-ahead reads 0,
lob logical reads 0, lob physical reads 0, lob read-ahead reads 0.

Pretty good, but like I said we could do better.

CREATE INDEX ix_contacts__firstname_lastname__inc_phonenumber ON contacts (firstname, lastname) INCLUDE (phoneNumber)

Now, look at the results:

results came back in 1ms
Table 'contacts'. Scan count 1, logical reads 5, physical reads 0, read-ahead reads 0,
lob logical reads 0, lob physical reads 0, lob read-ahead reads 0.

Much better!  By not having to go back to the original table, we save a ton of reads.  And that’s what the covered index is all about Charlie Brown.

I’m not telling you it’s always the answer, but if you know what covered indexes are, and you know how to apply them… You’ll be surprised how often it is the answer.

Any questions?  If so, send them in. I’m here to help!


Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Recent Posts

  • A New File Interrogator
  • Using Generative AI in Data Engineering
  • Getting started with Microsoft Fabric
  • Docker-based Spark
  • Network Infrastructure Updates

Recent Comments

  1. slowder on Data Engineering for Databricks
  2. Alex Ott on Data Engineering for Databricks

Archives

  • July 2023
  • June 2023
  • March 2023
  • February 2023
  • January 2023
  • December 2022
  • November 2022
  • October 2022
  • October 2018
  • August 2018
  • May 2018
  • February 2018
  • January 2018
  • November 2017
  • October 2017
  • September 2017
  • August 2017
  • June 2017
  • March 2017
  • February 2014
  • January 2014
  • December 2013
  • November 2013
  • October 2013
  • August 2013
  • July 2013
  • June 2013
  • February 2013
  • January 2013
  • August 2012
  • June 2012
  • May 2012
  • April 2012
  • March 2012
  • February 2012
  • January 2012
  • December 2011
  • November 2011
  • October 2011
  • September 2011
  • August 2011
  • July 2011
  • June 2011
  • May 2011
  • April 2011
  • March 2011
  • February 2011
  • January 2011
  • December 2010
  • November 2010
  • October 2010
  • September 2010
  • August 2010
  • July 2010
  • June 2010
  • May 2010
  • April 2010
  • March 2010
  • January 2010
  • December 2009
  • November 2009
  • October 2009
  • September 2009
  • August 2009
  • July 2009
  • June 2009
  • May 2009
  • April 2009
  • March 2009
  • February 2009
  • January 2009
  • December 2008
  • November 2008
  • October 2008
  • September 2008
  • August 2008
  • July 2008
  • June 2008
  • May 2008
  • April 2008
  • March 2008
  • February 2008
  • January 2008
  • November 2007
  • October 2007
  • September 2007
  • August 2007
  • July 2007
  • June 2007
  • May 2007
  • April 2007
  • March 2007
  • February 2007
  • January 2007
  • December 2006
  • November 2006
  • October 2006
  • September 2006
  • August 2006
  • July 2006
  • June 2006
  • May 2006
  • April 2006
  • March 2006
  • February 2006
  • January 2006
  • December 2005
  • November 2005
  • October 2005
  • September 2005
  • August 2005
  • July 2005
  • June 2005
  • May 2005
  • April 2005
  • March 2005
  • February 2005
  • January 2005
  • November 2004
  • September 2004
  • August 2004
  • July 2004
  • April 2004
  • March 2004
  • June 2002

Categories

  • Career Development
  • Data Engineering
  • Data Science
  • Infrastructure
  • Microsoft SQL
  • Modern Data Estate
  • Personal
  • Random Technology
  • uncategorized
© 2025 shannonlowder.com | Powered by Minimalist Blog WordPress Theme