Re: Efficient recursion

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: C Storm <christian(dot)storm(at)gmail(dot)com>
Cc: pgsql-performance(at)postgresql(dot)org
Subject: Re: Efficient recursion
Date: 2007-05-19 18:12:35
Message-ID: 14801.1179598355@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

C Storm <christian(dot)storm(at)gmail(dot)com> writes:
> Essentially, I'm looking for the most efficient way to break a
> database into two 'shards' based on a top level table's
> primary key. For example, split a sales database into two using a
> territory.

I think what you are looking for here is partitioning, not recursion.
PG's support for partitioned tables is a bit crude, but usable:
http://www.postgresql.org/docs/8.2/static/ddl-partitioning.html

regards, tom lane

In response to

Browse pgsql-performance by date

  From Date Subject
Next Message Guido Neitzer 2007-05-19 19:51:04 Re: performance drop on 8.2.4, reverting to 8.1.4
Previous Message Tom Lane 2007-05-19 18:10:06 Re: any way to get rid of Bitmap Heap Scan recheck?