> "- Oracle has one particular performance enhancement that Postgres is
> missing. If you do a select that returns 100,000 rows in a given order,
> and all you want are rows 99101 to 99200, then Oracle can do that very
> efficiently. With Postgres, it has to read the first 99200 rows and
> then discard the first 99100.
When I was reading up on resultset pagination on AskTom I got a clear
impression that the same happens in Oracle as well.
Resultset is like:
You first select all the rows from 0 to STOP and then from that select the
rows from START to end (which is now STOP). This is done using ROWNUM
twice and subselects.
It was discussed over there that this obviously produces higher response
times as you move towards the end of a very large resultset. Tom even
pointed out the same effect when using google search, as you move forward
through a very large (millions) search result.
CSA, DBA, Developer
In response to
pgsql-performance by date
|Next:||From: Radu-Adrian Popescu||Date: 2005-06-25 11:42:44|
|Subject: Re: Speed with offset clause|
|Previous:||From: Andreas Pflug||Date: 2005-06-25 07:46:18|
|Subject: Re: Configurator project launched|