2026-02-13
863 reads
2026-02-13
863 reads
In the last article, we examined fuzzy string matching in SQL Server 2025 with a few new functions. We know comparing strings has always been hard when we don't have great data quality. If we need exact matches, SQL Server works great. However, we often expect users to enter values without typos and know what […]
2026-01-23
1,825 reads
Comparing strings has always been hard when we don't have great data quality. If we need exact matches, SQL Server works great. However, we often expect users to enter values without typos and know what values they want to find. Or at least know part of the string. However, matching with wildcards or partial strings […]
2026-01-28 (first published: 2026-01-16)
2,625 reads
Learn about the new string similarity functions in Azure SQL Database.
2025-03-28
6,847 reads
An optimized Damerau-Levenshtein Distance (DLD) algorithm for "fuzzy" string matching in Transact-SQL 2000-2008
2014-01-10 (first published: 2012-09-18)
31,112 reads
Roll Your Own Fuzzy Match / Grouping (Jaro Winkler) - T-SQL
2009-06-10
44,875 reads
By ChrisJenkins
You could be tolerating limited reporting because there isn’t an off the shelf solution...
A while back I wrote a quick post on setting up key mappings in...
By Steve Jones
In 100 years a lot of what we take to be true now will...
Comments posted to this topic are about the item Lots of FKs
Comments posted to this topic are about the item Real-time On-prem SQL Server Data...
Comments posted to this topic are about the item Can You Let Go of...
In SQL Server 2025, what are the most outgoing and incoming FK references a table can have?
See possible answers