NoCOUG

Well, I’m not really comparing comparable numbers here.

The NoCOUG last submit date was the last day of june, and therefore it is past.
Iggy Fernandez wrote about the nine different solutions he received (I very like the title he has chosen) !

I’m the seventh in the list there.
As I told before, my favorite solution to this problem is André Aurajo’s one.

Alberto Dell’Era wrote an exceptional solution, but it is very hard to understand, both the mathematics and the SQL query.
André Aurajo’s is very understandable and coming from a simple but efficient idea.

Now we’ll just have to wait for the results, fortunately this is summer time and the wait should go fast.

This was really a great challenge, thanks again to the NoCOUG people !

TSQL Challenge

I’m a bit late to relay the information, but the T-SQL Challenge team published their eleventh challenge.

They can’t keep their one week schedule at the moment : there is no one to blame as I suppose they run against holidays, and I hope they have more and more solution to analyze, which is very time consuming, and they’re doing this to freely help T-SQL developers.

I found two solutions for this challenge, one using regular joins and another some recursion, I’m going to submit the last one.

I’ve also got an idea with some XML_PATH but I didn’t take time to look after, I’ll probably stick to my second solution.

I’ll publish it here the 28th of July, after the closure of the challenge.

Oh, and once again, they bring back the FREE training webcast which allows everyone to understand the basics behind the query !

If you want to get better with SQL, go over and register !