Gobs of indexes?

["Reeve" <news@xxxxxxxxxx>]

I'm going to let the Optimizer and the SQL Performance Monitor do the heavy
lifting; I'll create SQL indexes as required.  

-rf

> -----Original Message-----
> From: midrange-l-bounces@xxxxxxxxxxxx [mailto:midrange-l-
> bounces@xxxxxxxxxxxx] On Behalf Of Smith, Dave
> Sent: Monday, July 12, 2004 7:06 PM
> To: midrange-l@xxxxxxxxxxxx
> Subject: javac -classpath . Welcome1.java
> 
> From a coding standpoint it's a lot easier than setting up gobs of logical
> files.....from a performance standpoint, you better set up gobs of indexs!
> 
> - Dave
> 
>               ------------------------------
> 
>               message: 5
>               date: Mon, 12 Jul 2004 18:15:09 -0400
>               from: "Reeve" <news@xxxxxxxxxx>
>               subject: RE: SQL under the covers
> 
>               I might have messed up my example, and as I think about
> it more, I really am
>               trying to peek under the covers at execution time.  In
> simple terms, I'm
>               wondering how I debug a complex SQL statement that
> doesn't work, and I guess
>               there's no easy way to do it.  Sometimes the SQL error
> messages make you
>               think.
> 
>               If none the CASE statements evaluate as true in this
> example, no sort is
>               performed.  This logic works in several of my programs of
> varying shapes and
>               sizes; it makes a very cool we-don't-need-no-stinkin'-
> Windoze
>               point-and-double-click-to-sort application.  Green-screen
> folks accustomed
>               to limited order-of-data choices love it, and from a coding
> standpoint it's
>               a lot easier that setting up gobs of logical files.
> 
>               -rf
>