optimization via selection sets/indices

[Bill Vermillion]

On Mon, Oct 11 12:00 , while impersonating an expert on the internet, 
Robert Haussmann sent this to stdout: 

> We have a need to run real-time queries against a large
> database (2 million records).  Using rreport and 
> selection processing (-v) takes much too long.

I've found the -v processing with the indexed self-lookup is
faster than anything else I've used.

The first time I put that on a client computer one person ran the
report 3 times before coming to me and saying it didn't work.
The screen came back so fast he assumed that nothing had worked.

Granted it was far less than 2 million, but depending on how you
have things indexed it can be blazingly fast.   

Bill
-- 
Bill Vermillion - bv @ wjv . com