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,111 reads
A detailed look the B-Tree structure – Leaf level and non-leaf level.
2012-01-20
17,111 reads
Determining how, and if, SQL Server is using your indexes.
2011-10-05
15,807 reads
Indexes that ensure data integrity in addition to locating rows.
2011-09-14
13,417 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,263 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,795 reads
By Brian Kelley
If you want to learn better, pause more in your learning to intentionally review.
By John
If you’ve used Azure SQL Managed Instance General Purpose, you know the drill: to...
By DataOnWheels
Ramblings of a retired data architect Let me start by saying that I have...
Not sure if this is really a relational theory question but it seems about...
Hi everyone, Below is a consolidated summary of what we validated Architecture & data...
Hi all, I recently moved to a new employer who have their HA setup...
I have this data in a SQL Server 2025 table:
CREATE TABLE Response ( ResponseID INT NOT NULL CONSTRAINT ResponsePK PRIMARY KEY , ResponseVal VARBINARY(5000) ) GOIf I want to get a value from this table that I can add to a URL in a browser, which of these code items produces a result I can use? See possible answers