Index Internal Structure in SQL Server: Stairway to SQL Server Indexes Level 10
A detailed look the B-Tree structure – Leaf level and non-leaf level.
2012-01-20
17,123 reads
A detailed look the B-Tree structure – Leaf level and non-leaf level.
2012-01-20
17,123 reads
Determining how, and if, SQL Server is using your indexes.
2011-10-05
15,821 reads
Indexes that ensure data integrity in addition to locating rows.
2011-09-14
13,427 reads
A filtered index eliminates unusable entries from the index, producing an index that is as beneficial as, but much smaller than, an unfiltered index. If a certain subset of a table's data is frequently requested, a filtered index can also be a covering index; resulting in a considerable reduction in IO.
2011-08-24
15,275 reads
A nonclustered index entry consists of search key columns, included columns, and the bookmark. The bookmark value will be either a RID or the clustered index's key, depending upon whether the table is a heap or a clustered index. Choosing the best clustered index for a table requires that you follow three guidelines to ensure that the index key will make a good bookmark.
2011-08-03
15,811 reads
By Steve Jones
We had an interesting discussion about deployments in databases and how you go forward...
By ChrisJenkins
You could be tolerating limited reporting because there isn’t an off the shelf solution...
A while back I wrote a quick post on setting up key mappings in...
Comments posted to this topic are about the item Lots of FKs
Comments posted to this topic are about the item Real-time On-prem SQL Server Data...
Comments posted to this topic are about the item Can You Let Go of...
In SQL Server 2025, what are the most outgoing and incoming FK references a table can have?
See possible answers