Re: [HACKERS] Trying to reduce per tuple overhead (bitmap)

Manfred Koizar wrote: Tom Lane wrote in another tread: PS: I did like your point about BITMAPLEN; I think that might be a free savings. I was waiting for you to bring it up on hackers before commenting though... So here we go... Hi, in htup.h MinHeapTupleBitmapSize is defined to be

[HACKERS] Trying to reduce per tuple overhead (bitmap)

Tom Lane wrote in another tread: PS: I did like your point about BITMAPLEN; I think that might be a free savings. I was waiting for you to bring it up on hackers before commenting though... So here we go... Hi, in htup.h MinHeapTupleBitmapSize is defined to be 32, i.e. the bitmap uses at

Re: [HACKERS] Trying to reduce per tuple overhead (bitmap)

Manfred Koizar [EMAIL PROTECTED] writes: Proposal 2: Let BITMAPLEN calculate the minimum number of bytes necessary to have one bit for every attribute. #define BitMapBytes 1 old old new new NATTS BITMAPLEN THSIZE BITMAPLEN THSIZE 8436