Re: partition tree inspection functions
От | Jesper Pedersen |
---|---|
Тема | Re: partition tree inspection functions |
Дата | |
Msg-id | be99c5e5-2b2b-f29c-6674-11561ce6a31f@redhat.com обсуждение исходный текст |
Ответ на | Re: partition tree inspection functions (Robert Haas <robertmhaas@gmail.com>) |
Список | pgsql-hackers |
Hi, On 08/03/2018 08:59 AM, Robert Haas wrote: > On Fri, Aug 3, 2018 at 8:35 AM, Jesper Pedersen > <jesper.pedersen@redhat.com> wrote: >> If you are given a leaf partition as input, then you will have to keep >> executing the query until you find the root, and count those. So, I think it >> should be either be the level to the root, or there should be another column >> that lists that (rootlevel). > > I disagree. I think Amit has got the right semantics -- it gives you > everything rooted at the partition you name, relative to that root. > We could have another function which, given the OID of a partition, > returns the topmost parent (or the immediate parent), but I think that > if you say "tell me all the partitions of X", it should just tell you > about stuff that's under X, regardless of what's over X. > We had the 2 pg_partition_level() functions and pg_partition_leaf_children() in v8, so it would be good to get those back. Best regards, Jesper
В списке pgsql-hackers по дате отправления: