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
Views: Raw Message | Whole Thread | Download mbox | Resend email
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

Browse pgsql-hackers by date

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