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,148 reads
A detailed look the B-Tree structure – Leaf level and non-leaf level.
2012-01-20
17,148 reads
Determining how, and if, SQL Server is using your indexes.
2011-10-05
15,856 reads
Indexes that ensure data integrity in addition to locating rows.
2011-09-14
13,443 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,294 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,829 reads
Reading tutorials is fine. Shipping something is better. If you are trying to break...
By Steve Jones
We work hard at Redgate, though with a good work-life balance. One interesting observation...
By Arun Sirpal
Fourth in a series on Ai and databases. What Read-Only Advisory Actually Means A...
Comments posted to this topic are about the item Liability for AI Errors
Hello , I would like to run a stored procedure on a secondary replica...
Comments posted to this topic are about the item Pro SQL Server Internals
I run this command to start SQLCMD:
sqlcmd -S localhost -E -c "proceed"At the prompt, I type this (the 1> and 2> are prompts):
1> select @@version 2> goWhat happens? See possible answers