"Jim C. Nasby" <decibel(at)decibel(dot)org> writes:
> Well, every other database I've used can do index covering, which means
> index scans *are* faster.
Still not necessarily true. In a case like this it would still be random
access which would be slower than sequential access.
Though Oracle is capable of taking the best of both worlds and doing a hash
join but taking the data from sequentially reading the index instead of the
table.
--
greg