2013-05-07
2,293 reads
T-SQL
2013-05-06
2,121 reads
2013-05-03
2,240 reads
2013-05-02
2,028 reads
2013-05-01
1,749 reads
2013-04-30
2,261 reads
2013-04-29
2,102 reads
2013-04-26
2,250 reads
Solving Complex T-SQL Problems, Step-By-Step
What should you do if your first, most intuitive solution to a problem ends up scanning the data more than is necessary, resulting in poor performance? Have you missed a new SQL Server feature that can remove inefficiency from your technique? Alternatively, do you need a little help, and some lateral thinking, to open the path to a different approach? Sometimes, the answer is "both".
2013-04-25
6,949 reads
2013-04-22
2,238 reads
Blogs
AI: Blog a Day – Day 6: Embeddings – How AI Understands
By Vinay Thakur
Continuing from Day 5 where we covered notebooks, HuggingFace and fine tuning AI now...
The Book of Redgate: Mistakes
By Steve Jones
This is kind of a funny page to look at. The next page has...
ADF Pipeline Debugging Fails with BadRequest – The Sequel
A while ago I blogged about a use case where a pipeline fails during...
Forums
Dynamic Unpivot
I have a table I didn't design that has tons of repeating groups in...
Writing as an Art and a Job
Comments posted to this topic are about the item Writing as an Art and...
String Similarity II
Comments posted to this topic are about the item String Similarity II
Question of the Day
String Similarity II
What is the range for the result from the EDIT_DISTANCE_SIMILARITY() function in SQL Server 2025?
See possible answers