On 31 October 2014 12:54, Robert Haas <robertmhaas@gmail.com> wrote:
> 1. Turing's theorem being what it is, predicting what catalog tables
> the child might lock is not necessarily simple.
The Pareto principle offers ways to cope with the world's lack of simplicity.
You mentioned earlier that functions would need to be marked proisparallel etc..
What conditions will that be protecting against? If we aren't going to
support the general case where every single thing works, can we at
least discuss what the list of cases is that we will support.
I don't think we can argue that everything must be generic when we
already admit it won't be.
-- Simon Riggs http://www.2ndQuadrant.com/PostgreSQL Development, 24x7 Support, Training & Services