TSQL Challenge #12

I’m a bit late on this one !
The last submition date for TSQL Challenge #12 was yesterday !

But I had some holidays and the weather was sunny so I spend less time on my computer !

I couldn’t use (nor understand) the arithmetics Pacmann used in the comments of the previous blog entrie.

He managed to avoid the date functions using a lot of trunc (or floor) and modulo functions.
I suppose pure math computes faster than date functions. I’ll have to keep this in mind and to try it out seriously.

Ok, about the TSQL Solution so I did use the date functions !
Let’s begin with the initial datas : Continue reading ‘TSQL Challenge #12 Using Date Functions And Recursive CTE, Laurent Schneider Fun Stuff’

NoCOUG Challenge

After many months, Iggy Fernandez published his own solution of the first annual NoCOUG SQL Challenge.

His solution was performing fast from the beginning according to the graph he sent to Chen Shapira back in the announcement days :

I never managed Continue reading ‘NoCOUG SQL Challenge Author Solution, TSQL Challenge #12 !’

Well, this was a long wait for every participant of this challenge.

I entry the contest in April, and the winner has been announced yesterday by Iggy Fernandez and Chen Shapira.

It was indeed an amazing challenge and I thanks everyone who brought this up.

It was also the key factor for me to open this blog to publish my solution and more and more things around SQL and relational databases.

The Winner !

Alberto Dell’Era took the first place not with his incredible Fast Fourier Transform O(n^log(n)) complexity, but the other one using Discret Fourier Transform.
In his FFT solution he used the model clause with iterative arguments and the jury saw it has not being straithforward SQL.

But he still have Continue reading ‘First International NoCOUG SQL Challenge Is Over !’