Re: Declarative partitioning

From: Corey Huinker <corey(dot)huinker(at)gmail(dot)com>
To: Amit Langote <Langote_Amit_f8(at)lab(dot)ntt(dot)co(dot)jp>
Cc: Robert Haas <robertmhaas(at)gmail(dot)com>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Declarative partitioning
Date: 2016-03-09 01:41:11
Message-ID: CADkLM=cZCshc97P6Gwq-pDwf5EcYYYe2G+w5YuCsV_oVJrvvDg@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

>
> > So presently partitions that are unbounded on the lower end aren't
> > possible, but that's a creation syntax issue, not an infrastructure
> issue.
> > Correct?
>
> In case it wasn't apparent, you can create those:
>
> FOR VALUES END (upper-bound) [INCLUSIVE]
>
> which is equivalent to:
>
> FOR VALUES '(, upper-bound)' or FOR VALUES '(, upper-bound]'
>
>
Thanks for clarifying. My BNF-fu is weak.

>
>

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Chapman Flack 2016-03-09 01:49:22 Managing a long-held TupleDesc reference
Previous Message Tom Lane 2016-03-09 01:39:18 Re: Performance improvement for joins where outer side is unique