Summary
In this chapter, I showed you how SQL Server indexes organize the data on disk and help you access your data more quickly than if no indexes existed. Indexes are organized as B-trees, which means you will always traverse through the same number of index levels when you traverse from the root to any leaf page. To use an index to find a single row of data, SQL Server never has to read more pages than there are levels in an appropriate index.
You also learned about all the options available when you create an index, how to determine the amount of space an index takes up, and how to predict the size of an index that doesn’t have any data yet.
We looked at the internal structure of various kinds of index structures, and we looked at the metadata ...
Get Inside Microsoft® SQL Server™ 2005, Fourth Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
