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,190 reads
A detailed look the B-Tree structure – Leaf level and non-leaf level.
2012-01-20
17,190 reads
Determining how, and if, SQL Server is using your indexes.
2011-10-05
15,897 reads
Indexes that ensure data integrity in addition to locating rows.
2011-09-14
13,479 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,366 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,873 reads
By Steve Jones
It’s time for T-SQL Tuesday again and this is a great prompt to start...
By alevyinroc
T-SQL Tuesday is a monthly blog party hosted by a different community member each...
How I used AI for this postChatGPT to generate images based on info specifically...
Comments posted to this topic are about the item Databricks Genie Spaces for SQL...
Comments posted to this topic are about the item The Costs of Multiple Platforms
Comments posted to this topic are about the item RegEx Functions II
I have this data in a table in a SQL Server 2025 database:
EmailAddressID EmailAddress 7 dylan0@ADVENTURE-WORKS.COM 8 Diane1@ADVENTURE-WORKS.COMIf I run this query, which row(s) are returned?
SELECT top 10 * FROM person.EmailAddress WHERE REGEXP_LIKE(EmailAddress, '^d') AND BusinessEntityID IN (7,8)See possible answers