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,822 reads
Indexes that ensure data integrity in addition to locating rows.
2011-09-14
13,428 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,278 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,812 reads
By Steve Jones
One of the things I’ve tried hard to do in database development situations if...
By DataOnWheels
The T-SQL Tuesday topic this month comes James Serra. What career risks have you...
This T-SQL Tuesday is hosted by the one and only James Serra – literally...
We have two "identical" instances of an ASP.NET web service (or so I have...
Comments posted to this topic are about the item OPENQUERY Flexibility
Comments posted to this topic are about the item A Full Shutdown
Which of these are valid OPENQUERY() uses?
See possible answers