Skip site navigation (1) Skip section navigation (2)

Re: Hashtable entry recycling algorithm in pg_stat_statements

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: "Alex Hunsaker" <badalex(at)gmail(dot)com>
Cc: "ITAGAKI Takahiro" <itagaki(dot)takahiro(at)oss(dot)ntt(dot)co(dot)jp>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: Hashtable entry recycling algorithm in pg_stat_statements
Date: 2009-01-03 01:23:52
Message-ID: 14884.1230945832@sss.pgh.pa.us (view raw or flat)
Thread:
Lists: pgsql-hackers
"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

Responses

pgsql-hackers by date

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

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group