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

Re: Hashtable entry recycling algorithm in pg_stat_statements

From: "Alex Hunsaker" <badalex(at)gmail(dot)com>
To: "Tom Lane" <tgl(at)sss(dot)pgh(dot)pa(dot)us>
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:34:49
Message-ID: 34d269d40901021734g248cd705he01af48338787d0b@mail.gmail.com (view raw or flat)
Thread:
Lists: pgsql-hackers
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

pgsql-hackers by date

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

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