Re: Avoiding redundant fetches of btree index metapages

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Simon Riggs <simon(at)2ndquadrant(dot)com>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: Avoiding redundant fetches of btree index metapages
Date: 2006-04-26 16:53:55
Message-ID: 19169.1146070435@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Simon Riggs <simon(at)2ndquadrant(dot)com> writes:
> Hmmm.... I'm slightly worried that frequently-churning small tables will
> be made even slower by this. What do you think?

How so?

> So we would be able to cache other items also?

Only to the extent that you can guarantee a stale cache entry isn't a
problem. We've already done the analysis involved for the existing
metapage entries, but anything else would require more thought. (And
more cache flush events.)

> For that case we'd save N block accesses to locate the rightmost leaf
> page.

Surely you mean log(N).

regards, tom lane

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Simon Riggs 2006-04-26 17:29:13 Re: Avoiding redundant fetches of btree index metapages
Previous Message Gevik Babakhani 2006-04-26 16:48:15 Regarding TODO item "%Add a separate TRUNCATE permission"