Re: Shouldn't the planner have a higher cost for reverse index scans?

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Josh Berkus <josh(at)agliodbs(dot)com>
Cc: postgres performance list <pgsql-performance(at)postgresql(dot)org>
Subject: Re: Shouldn't the planner have a higher cost for reverse index scans?
Date: 2009-04-10 13:50:37
Message-ID: 21658.1239371437@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

Josh Berkus <josh(at)agliodbs(dot)com> writes:
> Now, what that says to me is that for this system reverse sequential
> reads are 1/4 the speed of forwards reads. And from my testing
> elsewhere, that seems fairly typical of disk systems in general.

Well, that's because filesystems try to lay out files so that logically
successive sectors are about as far apart as needed to support the
disk's maximum transfer rate. If you fetch them in reverse order,
then instead of optimizing the rotational latency you find you are
pessimizing it. This has got approximately nothing to do with
indexscans, either forward or reverse, because then we aren't fetching
blocks in a pre-optimized order.

> Now, while index scans (for indexes on disk) aren't 100% sequential
> reads, it seems like we should be increasing (substantially) the
> estimated cost of reverse index scans if the index is likely to be on
> disk. No?

AFAICS this is already folded into random_page_cost.

regards, tom lane

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Joshua D. Drake 2009-04-10 16:00:33 Re: Using IOZone to simulate DB access patterns
Previous Message Tom Lane 2009-04-10 13:42:26 Re: Nested query performance issue