From: Tom Lane <tgl@sss.pgh.pa.us>
To: C Storm <christian.storm@gmail.com>
Cc: pgsql-performance@postgresql.org
Subject: Re: Efficient recursion
Date: Sat, 19 May 2007 14:12:35 -0400
Message-ID: <14801.1179598355@sss.pgh.pa.us> (raw)
In-Reply-To: <1179528084.715044.215690@e65g2000hsc.googlegroups.com>
References: <1179528084.715044.215690@e65g2000hsc.googlegroups.com>
C Storm <christian.storm@gmail.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
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Reply to all the recipients using the --to and --cc options:
reply via email
To: pgsql-performance@postgresql.org
Cc: tgl@sss.pgh.pa.us, christian.storm@gmail.com
Subject: Re: Efficient recursion
In-Reply-To: <14801.1179598355@sss.pgh.pa.us>
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox