Re: Research/Implementation of Nested Loop Join optimization

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Ron Mayer <rm_pg(at)cheapcomplexdevices(dot)com>
Cc: Gregory Stark <stark(at)enterprisedb(dot)com>, Manoel Henrique <mhenriquesgbd(at)gmail(dot)com>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: Research/Implementation of Nested Loop Join optimization
Date: 2008-07-26 05:38:27
Message-ID: 8815.1217050707@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Ron Mayer <rm_pg(at)cheapcomplexdevices(dot)com> writes:
> Tom Lane wrote:
>> A backwards scan will get no such overlapping and thus be up to 2X
>> slower, unless the kernel is smart enough to do read-ahead for
>> descending-order read requests. Which seems not too probable.

> Linux's old adaptive readahead patches claimed to[1]:

I didn't say that there were *no* platforms that could do it.

regards, tom lane

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Markus Wanner 2008-07-26 08:17:18 Re: Transaction-controlled robustness for replication
Previous Message Ron Mayer 2008-07-26 05:27:58 Re: Research/Implementation of Nested Loop Join optimization