"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.

			regards, tom lane

In response to

• Re: Hashtable entry recycling algorithm in pg_stat_statements at 2009-01-03 01:20:19 from Alex Hunsaker

Responses

• Re: Hashtable entry recycling algorithm in pg_stat_statements at 2009-01-03 01:34:49 from Alex Hunsaker

pgsql-hackers by date

Next:	From: Tom Lane	Date: 2009-01-03 01:30:30
	Subject: Re: Significantly larger toast tables on 8.4?
Previous:	From: Alex Hunsaker	Date: 2009-01-03 01:20:19
	Subject: Re: Hashtable entry recycling algorithm in pg_stat_statements