pg.ddx.io  pgsql-hackers@postgresql.org mailing list archive  

help / color / mirror / Atom feed
From: Jesper Pedersen <jesper.pedersen@redhat.com>
To: Amit Langote <Langote_Amit_f8@lab.ntt.co.jp>
To: Robert Haas <robertmhaas@gmail.com>
Cc: Michael Paquier <michael@paquier.xyz>
Cc: Jeevan Ladhe <jeevan.ladhe@enterprisedb.com>
Cc: Pg Hackers <pgsql-hackers@postgresql.org>
Subject: Re: partition tree inspection functions
Date: Fri, 3 Aug 2018 08:35:55 -0400
Message-ID: <7f2e6674-9196-9fe7-1405-368bafd64198@redhat.com> (raw)
In-Reply-To: <28d6f8eb-afda-1bfd-141d-ca489cffb0ee@lab.ntt.co.jp>
References: <8d00e51a-9a51-ad02-d53e-ba6bf50b2e52@lab.ntt.co.jp>
	<5a560c9c-3722-1914-f34b-1de0ff3310d1@lab.ntt.co.jp>
	<CAOgcT0P8FC4Sat1ytVZgm09qd2bgMv-7pWpvU1HdBMKSah9r-w@mail.gmail.com>
	<d5f5b9a8-0c88-8043-2007-be37096bed39@lab.ntt.co.jp>
	<20180627121615.GF2667@paquier.xyz>
	<45e28062-976d-45bf-56f8-9746f551da02@lab.ntt.co.jp>
	<20180628034341.GH11054@paquier.xyz>
	<6baeb45a-6222-6b88-342d-37fc7d3cf89a@lab.ntt.co.jp>
	<4f4a2518-6c62-5463-6ac2-1241ae9d6041@redhat.com>
	<e12ff710-dcf5-18ff-b4a4-cc42432d84c4@lab.ntt.co.jp>
	<38183355-ea7c-9443-0c38-6124fcf5f38b@redhat.com>
	<5686970f-b4e8-bbe5-9109-b97763714c19@lab.ntt.co.jp>
	<da9f8b6d-13bb-18fe-7777-b3be7bdd327b@redhat.com>
	<3273a7af-3aca-eb86-cedb-f7b28be00831@lab.ntt.co.jp>
	<CA+TgmobhiREgUvKuMOoCCsPC6orjWKt_XoSd5shhCL7QVo8=Ag@mail.gmail.com>
	<28d6f8eb-afda-1bfd-141d-ca489cffb0ee@lab.ntt.co.jp>

Hi Amit,

On 08/03/2018 04:28 AM, Amit Langote wrote:
> That's a good idea, thanks.
> 
> Actually, by the time I sent the last version of the patch or maybe few
> versions before that, I too had started thinking if we shouldn't just have
> a SETOF RECORD function like you've outlined here, but wasn't sure of the
> fields it should have.  (relid, parentid, level) seems like a good start,
> or maybe that's just what we need.
> 

I think there should be a column that identifies leaf partitions (bool 
isleaf), otherwise it isn't obvious in complex scenarios.

> 
> Note that the level that's returned for each table is computed wrt the
> root table passed to the function and not the actual root partition.
> 

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).

Best regards,
  Jesper




view thread (74+ messages)  latest in thread

Message-ID: <7f2e6674-9196-9fe7-1405-368bafd64198@redhat.com>
Permalink:  ../7f2e6674-9196-9fe7-1405-368bafd64198@redhat.com/
Also on:    postgresql.org/message-id/7f2e6674-9196-9fe7-1405-368bafd64198@redhat.com

 · 

reply
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-hackers@postgresql.org
  Cc: jesper.pedersen@redhat.com, Langote_Amit_f8@lab.ntt.co.jp, robertmhaas@gmail.com, michael@paquier.xyz, jeevan.ladhe@enterprisedb.com
  Subject: Re: partition tree inspection functions
  In-Reply-To: <7f2e6674-9196-9fe7-1405-368bafd64198@redhat.com>

* 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