Re: [PERFORM] Efficient recursion

2007-05-19 Thread Tom Lane
C Storm <[EMAIL PROTECTED]> 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, no

[PERFORM] Efficient recursion

2007-05-19 Thread C Storm
This may be the wrong list to post to but I thought I'd post here first since it is a performance related problem. 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