After reading a recent article on identifying islands and gaps in sequential numbers, one of our readers was inspired to develop a more efficient solution for fragmented data. New Author Goce Smilevski brings us his solution and supporting data to show how this can be done better.
2021-04-16 (first published: 2004-11-22)
11,361 reads
It is often necessary to generate a table with sequential numbers, up to a specified upper limit N. For small N, a simple INSERT in a WHILE loop will do. But, for large N, that solution becomes too slow. This script presents a different approach. It generates sequential numbers from the binary representation of N, […]
2004-12-30 (first published: 2003-11-24)
644 reads
This a modification to the script given by Preethi.It generates prime numbers to the upper bound you specify.Modifications are using following facts from algebra:1. All prime numbers greater than 3 can be written in the form 6 * X +/- 1.2. Instead of checking the module for ALL numbers
2003-09-25
408 reads
No two SQL Server environments are alike. A fix that resolves a performance issue...
By ReviewMyDB
My T-SQL Tuesday #201 invitation. Do temp tables help performance or hurt it? I...
By Steve Jones
I have been experimenting with MCP servers in a few ways, and pressing on...
A new thread for testing the spam filter. Adding a link: https://www.bbc.co.uk/weather
Hello experts, An application team has asked us to modify a SQL Agent job....
Comments posted to this topic are about the item Advanced T-SQL: Replacing Slow Cursors...