Tom Lane writes:
>> hash table?
> I'd think the cost of hashing would render it impractical. Most of the
> papers I've seen on this topic worry about getting single instructions
> out of the search loop --- a hash lookup will cost lots more than that.
> Moreover, you'd lose the guarantee of not-
On Fri, Aug 10, 2007 at 10:32:35AM +0900, ITAGAKI Takahiro wrote:
> Here is a patch to reduce the size of PageFreeSpaceInfo on 64bit platform.
> We will utilize maintenance_work_mem twice with the patch.
>
> The sizeof(PageFreeSpaceInfo) is 16 bytes there because the type of 'avail'
> is 'Size', t
I think this is ready to be committed now.It's been a long and tiresome
road ;-)
Last-minute comments welcome.
cheers
andrew
Index: doc/src/sgml/config.sgml
===
RCS file: /cvsroot/pgsql/doc/src/sgml/config.sgml,v
retrieving revi
Pavel Ajtkulov <[EMAIL PROTECTED]> writes:
> Tom Lane writes:
>> Moreover, you'd lose the guarantee of not-worse-than-linear time,
>> because hash lookup can be pathologically bad if you get a lot of hash
>> collisions.
> compute max_wchar, min_wchar. If (d = max_wchar - min_wchar) < k (for
> exam
