April 29, 2003 at 7:57 pm
I see lot's of challenging query needs on this site and it would be nice to maybe do an occasional challenge with an extreme issue someone can dream up or maybe has/is experienced with. Try to provide a backup of the DB to download and restore to the participants test machines to ensure all details are there. And then let everyone submit their query code to meet the required results with the best performance. And it doesn't even have to have a major prize behind it. Maybe just a King of the Query title and a note in a Hall Of Fame. This might be interesting and could show us as a whole new ways of thinking to apply in our everyday work.
April 30, 2003 at 6:30 am
That's not bad. Didn't I see one of those in the last couple days? Something where you used a cross join to solve it?
Andy
April 30, 2003 at 9:29 am
Not a bad idea, though I suspect only a few of you (Antares) would be likely to spend the time to solve it. Course I could be wrong, but it's worth considering.
Steve Jones
April 30, 2003 at 11:57 am
Great idea for those who could participate. Maybe a poll could be used to find out how many can/will participate. I can't for three reasons:
1. don't have a test/development setup (thanks to management)
2. I can't download from the Internet. Sysadmin has to do it.
3. don't have SQL Server at home.
-SQLBill
April 30, 2003 at 12:12 pm
Get an MSDE copy, and install the SQL tools from SQL 2K eval edition. Anyway, I have a major task ahead of me building a database to handle call routing on an Aspect Call Center involving 3 switches so I may have a few scenarios pop up I can share. And I always have lot's of things asked at work or I see that may be able to be used. I write lots of oddball queries that have good performance but some people think of other things that allow me to go even further and thus it would be a learniyng experience for, I think, all.
April 30, 2003 at 1:08 pm
I'll put a simple one together for next week, we'll see what happens.
Andy
December 19, 2003 at 2:40 am
Continuing to clean up my archive..
Anything new on this?
Frank
--
Frank Kalis
Microsoft SQL Server MVP
Webmaster: http://www.insidesql.org/blogs
My blog: http://www.insidesql.org/blogs/frankkalis/[/url]
December 19, 2003 at 3:24 pm
Probably not. I'll remind Andy.
Don't be too excited, we're all slammed between work, the site and the magazine. Actually Frank, maybe you want to build one?
Steve Jones
http://www.sqlservercentral.com/columnists/sjones
The Best of SQL Server Central.com 2002 - http://www.sqlservercentral.com/bestof/
December 20, 2003 at 1:27 pm
I know, I know. Don't hang out the window too far or what do you say?
You need help?
Well, here I am! And I'm sure there are other members who also would like to contribute a little bit more.
What there might be to do?
- Moderate the forums
- Review articles
- Review QODs
- Review Scripts
- ....
Frank
--
Frank Kalis
Microsoft SQL Server MVP
Webmaster: http://www.insidesql.org/blogs
My blog: http://www.insidesql.org/blogs/frankkalis/[/url]
December 20, 2003 at 2:58 pm
Actually I have already some of those brainteasers in my pocket.
But they are, of course, closely related to my profession and I am uneasy if financial mathematics is that interesting for other members and I guess they require a background in this area.
Frank
--
Frank Kalis
Microsoft SQL Server MVP
Webmaster: http://www.insidesql.org/blogs
My blog: http://www.insidesql.org/blogs/frankkalis/[/url]
December 21, 2003 at 12:19 pm
Excellent idea!
Used to do a lot of Joe Celko puzzles for training purposes(1997).
Could not wait to get to work to compare their solution with mine!
December 21, 2003 at 1:24 pm
You bring in the right name.
I know Celko did some stuff on NPV and IRR calculations.
And I know in most cases the answer should be:
'Do this in your client application'
But sometimes it's fun to show that it can be done in SQL.
Frank
--
Frank Kalis
Microsoft SQL Server MVP
Webmaster: http://www.insidesql.org/blogs
My blog: http://www.insidesql.org/blogs/frankkalis/[/url]
Viewing 12 posts - 1 through 11 (of 11 total)
You must be logged in to reply to this topic. Login to reply