# | Date | Where | Item | Comment |
6 | 01 Dec 2014 @ 11:53 PST | GeorgeColeman's blog | Ordered Analytical Functions: Translating SQL Functions to Set SQL | Yes, this does sound hard, but it sounds like something you can solve with some patience. I would hope you could find a way to turn those scalar subqueries into selects that can be joined wit... |
5 | 23 May 2012 @ 12:23 PDT | GeorgeColeman's blog | Using Derived Tables as a Shortcut to Set SQL | Yes, there are things that seem just too difficult if not impossible to do in Set SQL. Usually these things have many, many lines of if-statements. It is possible to have so many IF's that the corr... |
4 | 22 May 2012 @ 12:07 PDT | GeorgeColeman's blog | Using Derived Tables as a Shortcut to Set SQL | Thank you, Pranu,
This is a good example of a cursor loop that does not need to be eliminated for two reasons: first, the cursor is looking for certain list of table names in the data dictionary. ... |
3 | 25 Nov 2011 @ 05:58 PST | GeorgeColeman's blog | Loops to Sets: A Brief History of Database Programming Logic | I find that it helps a lot to read good SQL examples from other people. Two good resources for that are the Teradata SQL DML manual and the SQL Functions manual. (www.info.teradata.com.). These man... |
2 | 18 Sep 2011 @ 08:45 PDT | GeorgeColeman's blog | Converting Complex Procedure Logic to Set SQL Using Derived Tables | No, that's right - it was a scrap left over from the original code on which this example is based. I've corrected it, and I hope no one was confused by that. Thank you for catching it, and than... |
1 | 12 May 2011 @ 03:36 PDT | GeorgeColeman's blog | From Flat Logic to Set Logic - a basic approach | Yes, this code worked pretty much as shown here a couple of years ago. (There could be some typos in this text.) Of course, you would have to create tables that have the names and columns used he... |
|
|