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,339 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)
630 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
397 reads
By Steve Jones
We had an interesting discussion about deployments in databases and how you go forward...
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...
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