I am currently reading Kalen Delany and others book on SQL Server 2008 System internals. If you have not read this book from cover to cover, you should. It has a wealth of knowledge about database engine details. To demonstrate key ideas from the book, I am going to expand on the [MATH] database that contains PRIME numbers. The trial division algorithm inside this database uses a brute force method for calculating prime numbers. This article will focus on files and objects that can be viewed through the system views,…

# Tag: prime numbers

## Calculating Primes – Part 1

Today I am going to talk about calculating primes. Not the Transformer movie in which Optimus Prime has to help the humans save the world. I am talking about prime numbers in which the number is only divisable by one and itself. The Algorithm that I am going to introduce is a brute force method for calculating prime numbers. It is great for comparing the computing power of two machines by looking at overall execution times. This routine consists in dividing n by each integer m which is greater than…

## Calculating Primes

Today I am going to talk about calculating primes. Not the new Transformer movie in which Optimus Prime has to help the humans save the world. I am talking about prime numbers in which the number is only divisable by one and itself. The Algorithm that I am going to introduce is a brute force method for calculating prime numbers. It is great for comparing the computing power of two machines by looking at overall execution times. This routine consists in dividing n by each integer m which is greater…