On Fri, Jan 2, 2009 at 18:23, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
> "Alex Hunsaker" <badalex(at)gmail(dot)com> writes:
>> Its seems to me a linear list would make the "common" case where the
>> query is already in the list but we need to update the stats slow.
>
> No, the hashtable is still there for lookups.  The list would be a means
> of determining which hashtable entry to release when we're out of space.

Ahh ok well #1 seems easier to do and it seems like it would even be
faster than a clock and sweep...

In response to

• Re: Hashtable entry recycling algorithm in pg_stat_statements at 2009-01-03 01:23:52 from Tom Lane

pgsql-hackers by date

Next:	From: Tom Lane	Date: 2009-01-03 01:36:16
	Subject: Re: Significantly larger toast tables on 8.4?
Previous:	From: Tom Lane	Date: 2009-01-03 01:30:30
	Subject: Re: Significantly larger toast tables on 8.4?