Re: On partitioning

On 12/5/14, 2:02 PM, Robert Haas wrote:
> On Fri, Dec 5, 2014 at 2:52 PM, Jim Nasby <Jim(dot)Nasby(at)bluetreble(dot)com> wrote:
>> The other option would be to use some custom rowtype to store boundary
>> values and have a method that can form a boundary tuple from a real one.
>> Either way, I suspect this is better than frequently evaluating
>> pg_node_trees.
>
> On what basis do you expect that? Every time you use a view, you're
> using a pg_node_tree. Nobody's ever complained that having to reload
> the pg_node_tree column was too slow, and I see no reason to suppose
> that things would be any different here.
>
> I mean, we can certainly invent something new if there is a reason to
> do so. But you (and a few other people) seem to be trying pretty hard
> to avoid using the massive amount of infrastructure that we already
> have to do almost this exact thing, which puzzles the heck out of me.

My concern is how to do the routing of incoming tuples. I'm assuming it'd be significantly faster to compare two tuples than to run each tuple through a bunch of nodetrees.
--
Jim Nasby, Data Architect, Blue Treble Consulting
Data in Trouble? Get it in Treble! http://BlueTreble.com