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,315 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)
622 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
389 reads
By Chris Yates
For decades, enterprises have approached data management with the same mindset as someone stuffing...
Truncate Table Pitfalls Truncating a table can be gloriously fast—and spectacularly dangerous when used carelessly....
You can find all the session materials for the presentation “Indexing for Dummies” that...
Comments posted to this topic are about the item Technological Dinosaurs or Social Dinosaurs?
Comments posted to this topic are about the item DBCC CHECKIDENT
Comments posted to this topic are about the item Distributed Availability Group Health: T-SQL...
What is returned as a result set when I run this command without a new seed value?
See possible answers