Tom Lane <[EMAIL PROTECTED]> wrote:
> This seems extremely invasive for a relatively small gain :-(
> The example you cite of an int4 index on a MAXALIGN-8 machine is
> by far the best case, and in many cases there wouldn't be anything
> bought by the extra complexity.
I also think that it has sm
ITAGAKI Takahiro <[EMAIL PROTECTED]> writes:
> Attached is a patch that removes undesired paddings from b-tree indexes.
This seems extremely invasive for a relatively small gain :-(
The example you cite of an int4 index on a MAXALIGN-8 machine is
by far the best case, and in many cases there would
Attached is a patch that removes undesired paddings from b-tree indexes.
The tuples of b-tree index consist of BTItemData and index keys. BTItemData
should be placed only 2 byte alignment, so if the alignment of keys are less
than MAXIMUM_ALIGNOF, we can place them with their minimum alignment ins
