Re: Declarative partitioning grammar

From: Jeff Cohen <jcohen(at)greenplum(dot)com>
To: Peter Eisentraut <peter_e(at)gmx(dot)net>
Cc: pgsql-hackers(at)postgresql(dot)org, Mike <ipso(at)snappymail(dot)ca>, Gavin Sherry <swm(at)alcove(dot)com(dot)au>
Subject: Re: Declarative partitioning grammar
Date: 2008-01-15 03:26:12
Message-ID: 368FCCC7-F201-47F7-9ED6-1468A88DBA83@greenplum.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers


On Jan 12, 2008, at 9:34 AM, Peter Eisentraut wrote:

> Well, with an extensible system such as PostgreSQL you will need to
> have a
> partitioning scheme that can deal with extensions. Perhaps people
> want to
> partition by XML, GIS, text-search data, or whatever someone might
> come up
> with in the future.

Hi Peter,

In the proposed solution, hash and list partitions work for all types
that support an equality operator, and range partitions work for all
types that support fully-ordered comparison.

kind regards,

Jeff

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Tom Lane 2008-01-15 03:33:28 Re: SSL over Unix-domain sockets
Previous Message Bruce Momjian 2008-01-15 03:24:06 Re: SSL over Unix-domain sockets