I'm not sure parse time is your problem. The query appears to do a search on
admin_report_dates via an index and for every row found, does a full-table
scan of mrtg_int_roll. This can be very slow if many rows are found and the
table scanned is quite large.
>
> Execution Plan
> ----------------------------------------------------------
> 0 SELECT STATEMENT Optimizer=3DCHOOSE (Cost=3D5837 Card=3D1
=Bytes=3D29 8)
> 1 0 SORT (GROUP BY) (Cost=3D5837 Card=3D1 Bytes=3D298)
> 2 1 NESTED LOOPS (Cost=3D5831 Card=3D1 Bytes=3D298)
> 3 2 INDEX (RANGE SCAN) OF 'ADMIN_REPORTDATES_IX1' (NON-UNI
> QUE) (Cost=3D2 Card=3D1 Bytes=3D51)
> 4 2 TABLE ACCESS (FULL) OF 'MRTG_INT_ROLL' (Cost=3D5829 Card
> =3D9 Bytes=3D2223)
Received on Thu Jan 31 2002 - 03:12:08 CST
