On Fri, Jan 2, 2009 at 18:23, Tom Lane <tgl@sss.pgh.pa.us> wrote:
> "Alex Hunsaker" <badalex@gmail.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...
