Craig,

>Memory structures are different for arrays than cursors. I agree, that with a large array, paging could occur. But I think it is more likely to occur with a cursor because of the way they are managed.

AFAIK, cursors (IF NOT FILTERED) are always stored on disk, like an ordinary table would. In general there is no need to hold the whole cursor into memory. Therefore, it is not likely that paging problems occur when using cursors. OTOH, Arrays should be available in memory. When they're large the easely can create paging problems.

But when the result just are a few rows, I Agree, Arrays will be faster than cursors.

Walter,