Aaron Bertrand shows how to implement simple triggers that maintain trigram-type tables used for better supporting wildcard searches.
Category: T-SQL (5)
In an effort to make leading wildcard searches sargable, Aaron Bertrand plays around with a trigram-type implementation in SQL Server.
Aaron Bertrand acknowledges that DISTINCT and GROUP BY are usually interchangeable, but shows there are cases where one performs better than the other.
Aaron Bertrand starts digging deeper into the performance of string concatenation methods STRING_AGG and FOR XML PATH.
Aaron Bertrand takes an initial look at the performance of a new function, STRING_AGG, in SQL Server v.Next CTP 1.1.
After a recent conversation on Twitter, Aaron Bertrand shows where excessive comments in your stored procedures might have an impact on performance.
Aaron Bertrand explains why he always opts for one of these options over the other, even in cases where it shouldn't matter.
Rob Farley discusses some solutions and gotchas for implementing a custom sort using ORDER BY in T-SQL queries.
Aaron Bertrand explains why he codes defensively - matching the case of data type names, even when it isn't strictly necessary.
Paul White shows that SQL Server sometimes produces very misleading information about the impact of sort operations.
Aaron Bertrand talks about pattern matching, a childhood game called Simon, and the unpredictability of CHARINDEX vs. LIKE.
Rob Farley explains why AT TIME ZONE is his new favourite feature in SQL Server 2016, but also shows that it can make a mess of cardinality estimates.
Melissa Connors discusses locating & resolving SQL Server database trust issues (check constraints & foreign keys).
Aaron Bertrand continues his #EntryLevel challenge, discussing DATEFROMPARTS() and similar functions introduced in SQL Server 2012.
Today I presented at Discovery Day New England, a SQL Server 2016 event (sponsored in part by SQL Sentry) held at the Microsoft office in Cambridge, MA. Attached are demos and slide decks.
