As SQL developers, we tend to think of performance tuning in terms of crafting the best table indices, avoiding scalar and table valued functions, and analyzing query plans (among other things). But sometimes going back to the spec and applying some properties of elementary math can be the best way to begin to improve performance of SQL queries which implement mathematical formulas. This article is a case study of how I used this technique to optimize my SQL implementation of the Inverse Simpson Index.
A fun exercise, using CTEs to implement John Conway's Game of Life cellular automata simulation
Cursors are considered by many to be the bane of good T-SQL. What are the best ways to avoid iterative T-SQL and to write queries that look and perform beautifully? This first part in an ongoing series of cursor-killing handles inter-row analysis.
I run this code on SQL Server 2019:
DBCC CLONEDATABASE(imdb, imdb_dev)I then change to the cloned database, imdb_dev, and run some queries. I then run this code while testing:
INSERT dbo.Title (TitleID, Title, DateReleased) VALUES (3234, 'Maestro', '2023') GOWhat happens? See possible answers