Re: Declarative partitioning

The lists for list partitioned tables are stored as they are specified by
the user. While searching for a partition to route tuple to, we compare it
with every list value of every partition. We might do something better
similar to what's been done to range partitions. The list of values for a
given partition can be stored in ascending/descending sorted order. Thus a
binary search can be used to check whether given row's partition key column
has same value as one in the list. The partitions can then be stored in the
ascending/descending order of the least/greatest values of corresponding
partitions. We might be able to eliminate search in a given partition if
its lowest value is higher than the given value or its higher value is
lower than the given value.

On Thu, Jul 21, 2016 at 10:10 AM, Amit Langote <
Langote_Amit_f8(at)lab(dot)ntt(dot)co(dot)jp> wrote:

> On 2016/07/19 22:53, Ashutosh Bapat wrote:
> > I am seeing following warning with this set of patches.
> > gram.y:4734:24: warning: assignment from incompatible pointer type
> [enabled
> > by default]
>
>
> Thanks, will fix. Was a copy-paste error.
>
> Thanks,
> Amit
>
>
>

--
Best Wishes,
Ashutosh Bapat
EnterpriseDB Corporation
The Postgres Database Company