I have a child table called wbs_numbers. the primary key id is a ltree

A typical example is

so the parent table called series. it has a field called last_contigous_max.

given the above example, i want the series of id 1 to have its last contigous max be 3

can always assume that the ltree of wbs is always 3 fragment separated by dot. and the last fragment is always a 5 digit numeric string left padded by zero. can always assume the first child is always ending with 00001 and the theoretical total children of a series will never exceed 9999.

If you think of it as gaps and islands, the wbs_numbers will never start with a gap within a series. it will always start with an island.

meaning to say this is not possible.

This is possible

so the last max contiguous in this case is

• for series id 1 => 1
• for series id 2 => 3
• for series id 3 => 4

What's the query to calculate the last_contigous_max number for any given series_id?

I also don't mind having another table just to store "islands".

Also, you can safely assume that wbs_number records will never be deleted once created. The id in the wbs_numbers table will never be altered once filled in as well.

Meaning to say islands will only grow and never shrink.

CodePudding user response：

You can carry out your problem following these steps:

• extract your integer value from your "id" field
• compute a ranking value sided with your id value
• filter out when your ranking value does not match your id value
• get tied last row for each of your matches

WITH cte AS (
    SELECT *, CAST(RIGHT(id_, 4) AS INTEGER)  AS idval
    FROM tab
), ranked AS (
    SELECT *,
           ROW_NUMBER() OVER(PARTITION BY series_id ORDER BY idval) AS rn
    FROM cte
)
SELECT series_id, idval
FROM ranked
WHERE idval = rn
ORDER BY ROW_NUMBER() OVER(PARTITION BY series_id ORDER BY idval DESC)
FETCH FIRST ROWS WITH TIES

Check the demo here.