With how we do things right now, does it actually gain us anything
to have a presorted table? Do we know not to do a seek on an index scan
if we're already at the right location in the heap file? We can't assume
the table is sorted (unless it hasn't been modified), so it's not like we
can sequence scan and stop when the bounds are met. If we don't do the
seek though, this could definately be good for mostly static data since
that might allow us to mostly not do seeks on normal conditions.
On Fri, 13 Oct 2000, Zeugswetter Andreas SB wrote:
>
> > > > He does ask a legitimate question though. If you are
> > going to have a
> > > > LIMIT feature (which of course is not pure SQL), there
> > seems no reason
> > > > you shouldn't be able to insert the result into a table.
> > >
> > >
> >
> > This is an interesting idea. We don't allow ORDER BY in
> > INSERT INTO ...
> > SELECT because it doesn't make any sense, but it does make sense if
> > LIMIT is used:
>
> An "order by" also makes sense if you want to create a presorted table
> for faster access. I don't see why we should disallow it.
>
> Andreas
>
